lintcode 容易题：Recover Rotated Sorted Array恢复旋转排序数组

public class Solution {
    /**
     * @param nums: The rotated sorted array
     * @return: void
     */
    public void recoverRotatedSortedArray(ArrayList<Integer> nums) {
        // write your code
        int numslen = nums.size();
        int i=0;
        for(i=0;i<numslen-1;i++){
            if(nums.get(i)>nums.get(i+1)){
                reverse(nums,0,i);
                reverse(nums,i+1,numslen-1);
                reverse(nums,0,numslen-1);
            }
        }

    }
    public void reverse(ArrayList<Integer> nums,int start,int end){
        while(start<end){
            int tmp = nums.get(start);
            nums.set(start,nums.get(end));
            nums.set(end,tmp);
            start++;
            end--;
        }
    }
}

class Solution:
    """
    @param nums: The rotated sorted array
    @return: nothing
    """
    def recoverRotatedSortedArray(self, nums):
        # write your code here
        if nums==None:
            return
        numslen = len(nums)
        for index in range(numslen-1):
            if(nums[index]>nums[index+1]):
                self.reverse(nums,0,index)
                self.reverse(nums,index+1,numslen-1)
                self.reverse(nums,0,numslen-1)
                
    def reverse(self,nums,start,end):
        while start<end:
            self.swap(nums,start,end)
            start+=1
            end-=1
            
    def swap(self,nums,start,end):
        tmp = nums[start]
        nums[start] = nums[end]
        nums[end] = tmp