摘要: 1752. 检查数组是否经排序和轮转得到 class Solution { public boolean check(int[] nums) { int n = nums.length; int x = 0; for(int i = 0 ; i < n - 1 ; i ++ ){ if(nums[i 阅读全文
posted @ 2022-11-27 16:04 Eiffelzero 阅读(28) 评论(0) 推荐(0)