leetcode 耗时100 1752. Check if Array Is Sorted and Rotated

Problem: 1752. 检查数组是否经排序和轮转得到

耗时100%，

找到n[i] > n[i+1]的索引，然后拼后面 + 拼前面，对原数组排序

看两个数组是否相同

Code

class Solution { public: bool check(vector<int>& nums) { int n = nums.size(); int find = -1; for(int i = 0; i < n-1; i++) { if(nums[i] > nums[i+1]) { find = i; break; } } if(find < 0) return true; vector<int> tr0; for(int i = find + 1; i < n; i++) { tr0.push_back(nums[i]); } for(int i = 0; i <= find; i++) { tr0.push_back(nums[i]); } sort(nums.begin(), nums.end()); if(tr0 == nums) return true; return false; } };