恢复旋转排序数组

思路

代码

public void recoverRotatedSortedArray(List<Integer> nums) {
int temp = nums.get(0);
boolean[] status = new boolean[nums.size()];
Arrays.fill(status, false);

int temp2;
int pos = 0;
int pointer = 0;
int count = 0;
int pointerNew;
for (int i = 0; i < nums.size(); i++) {
if (temp > nums.get(i)) {
temp = nums.get(i);
pos = i;
}
}

if (pos == 0) {
return;
}

for (int i = 0; i < nums.size() && status[i] == false; i++) {
temp = nums.get(i);
pointer = i;
while (true) {
pointerNew = pointer - pos;
if (pointerNew < 0) {
pointerNew  += nums.size();
}
if (status[pointerNew] == false) {
temp2 = nums.get(pointerNew);
nums.set(pointerNew, temp);
status[pointerNew] = true;
temp = temp2;
pointer = pointerNew;
}else {
break;
}
}
}

}

参考