1class Solution {2 public:3 bool check(vector<int> &nums) {4 int count = 0;5 for (int i = 0; i < nums.size(); i++) {6 if (nums[i] > nums[(i + 1) % nums.size()]) count++;7 }8 return (count <= 1);9 }10};
WPM •0 •0
ACC •0 •0
TIME •0