1752. Check if Array Is Sorted and Rotated

题目：

Given an array nums, return true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero). Otherwise, return false.

There may be duplicates in the original array.

Note: An array A rotated by x positions results in an array B of the same length such that A[i] == B[(i+x) % A.length], where % is the modulo operation.

 

Example 1:

Input: nums = [3,4,5,1,2]
Output: true
Explanation: [1,2,3,4,5] is the original sorted array.
You can rotate the array by x = 3 positions to begin on the the element of value 3: [3,4,5,1,2].

Example 2:

Input: nums = [2,1,3,4]
Output: false
Explanation: There is no sorted array once rotated that can make nums.

Example 3:

Input: nums = [1,2,3]
Output: true
Explanation: [1,2,3] is the original sorted array.
You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.

Example 4:

Input: nums = [1,1,1]
Output: true
Explanation: [1,1,1] is the original sorted array.
You can rotate any number of positions to make nums.

Example 5:

Input: nums = [2,1]
Output: true
Explanation: [1,2] is the original sorted array.
You can rotate the array by x = 5 positions to begin on the element of value 2: [2,1].

 

Constraints:

• 1 <= nums.length <= 100
• 1 <= nums[i] <= 100

 

 

 

 

思路：

sorted和rotated都是老题目了，不过这题只是要确认是否符合这两个条件即可，唯一关键点就是要想清楚如果符合，那么对于index i，nums[i]大于nums[i+1]的次数只会小于等于一次，不可能更多。同时题目中有给出，rotate就是nums[(i+x)%length]，那么这就很简单了，直接遍历数组，确认出现次数即可。

 

 

 

 

代码：

class Solution {
public:
    bool check(vector<int>& nums) {
        int count=0;
        for(int i=0;i<nums.size();i++)
        {
            if(nums[i]>nums[(i+1)%nums.size()])
                count++;
        }
        return count>1?false:true;
    }
};