[刷题]Recover Rotated Sorted Array

[LintCode]Recover Rotated Sorted Array

public class Solution {    /**     * @param nums: The rotated sorted array     * @return: The recovered sorted array     */    public void recoverRotatedSortedArray(ArrayList<Integer> nums) {        // 2015-4-14        if (nums == null || nums.size() <= 1) {            return;        }                for (int i = 1; i < nums.size(); i++) {            if (nums.get(i - 1) > nums.get(i)) {                reverse(nums, 0, i-1);                reverse(nums, i, nums.size() - 1);                reverse(nums, 0, nums.size() - 1);                return;            }        }        return;    }        private void reverse(ArrayList<Integer> nums, int start, int end) {        for (int i = start, j = end; i < j; i++, j--) {            int temp = nums.get(i);            nums.set(i, nums.get(j));            nums.set(j, temp);        }    }}