回溯 - 检查数组是否经排序和旋转后所得的子序列

1752.js

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
let nums = [3, 4, 5, 1, 2];
let MinIndex = nums.indexOf(Math.min(...nums));
let length = nums.length;
for (let i = MinIndex; i < length + 1; i++) {
    let popNum = nums.pop();
    nums.unshift(popNum);
}
const checkIncrease = (arr) => {
    for (let i = 0; i < arr.length - 1; i++) {
        if (arr[i] > arr[i + 1]) {
            return false;
        }
    }
    return true;
};
console.log(checkIncrease(nums));

1752.ts

 let nums = [3,4,5,1,2]
 
 let MinIndex = nums.indexOf(Math.min(...nums))
 let length = nums.length
    for (let i = MinIndex; i < length+1; i++) {
        let popNum  = nums.pop()
        nums.unshift(popNum as number)
    }

    const checkIncrease=(arr:number[])=>{
        for(let i=0;i<arr.length-1;i++){
            if(arr[i]>arr[i+1]){
                return false

            }
        }
        return true
    }

   console.log(checkIncrease(nums))

源码地址

• JavaScript
• TypeScript