Want to know:

首先找到最后一段递减的区间反转这段区间然后从这段区间的开头开始找到第一个比这段区间前一个值大的值，交换 int i = len - 1; while(i > 0 && nums[i] <= nums[i - 1]) { i--; } if(i == 0) { Arrays.sort(nums); return; } for(int j = 0; j < (len - i) / 2; j++) { swap(nums, i + j, len - 1 - j); } for(int j = i; j < len; j++){ if(nums[j] > nums[i - 1]) { swap(nums, j, i - 1); break; } }

Get a detailed, AI-powered explanation for this question and thousands more on StudyFetch.