给定一个旋转排序数组,在原地恢复其排序。
public class Solution { /** * @param nums: An integer array * @return: nothing */ public void recoverRotatedSortedArray(List<Integer> nums) { // write your code here Integer tmp; int index = -1; for (int i = 0; i < nums.size() - 1; i++) { if (nums.get(i) > nums.get(i+1)) { index = i; break; } } if (index == -1) { return; } for (int i = 0; i <= index; i++) { tmp = nums.remove(0); nums.add(tmp); } } }