Recover Rotated Sorted Array

 1 public class Solution {
 2     /**
 3      * @param nums: The rotated sorted array
 4      * @return: void
 5      * cnblogs.com/beiyeqingteng/
 6      */
 7     public void recoverRotatedSortedArray(ArrayList<Integer> nums) {
 8         if (nums==null || nums.size()==0 || nums.size()==1) return;
 9         int i = 0;
10         for (i=0; i<nums.size()-1; i++) {
11             if (nums.get(i) > nums.get(i+1)) break;
12         }
13         if (i == nums.size()-1) return;
14         reverse(nums, 0, i);
15         reverse(nums, i+1, nums.size()-1);
16         reverse(nums, 0, nums.size()-1);
17     }
18     
19     public void reverse(ArrayList<Integer> nums, int l, int r) {
20         while (l < r) {
21             int temp = nums.get(l);
22             nums.set(l, nums.get(r));
23             nums.set(r, temp);
24             l++;
25             r--;
26         }
27     }
28 }