39 - 恢复旋转排序数组

4.18

public class Solution {
    /**
     * @param nums: The rotated sorted array
     * @return: void
     */
    public void recoverRotatedSortedArray(ArrayList<Integer> nums) {
        int  size = nums.size();
        if(size <=1){
            return;
        }
        // write your code
        //如果已经是有序的
        if(nums.get(0) < nums.get(size -1)){
            return;
        }

       while(nums.get(0) >= nums.get(size-1)){
            nums.add(nums.get(0));
            nums.remove(0);
       }

    }
}