问题有点迷惑性。后来想到他们没有要求不能修改A,也就简单多了。
Given an unsorted integer array, find the first missing positive integer.
For example,
Given [1,2,0]
return 3
,
and [3,4,-1,1]
return 2
.
Your algorithm should run in O(n) time and uses constant space.
public class Solution {
public int firstMissingPositive(int[] A) {int l = A.length;
if (A.length == 0) {
return 1;
}
int t = 0;
int v = 0;
for (int i = 0; i < A.length; i++) {
v = A[i];
if (v <= 0 || v > A.length) {
A[i] = 0;
continue;
} else {
int index = i;
while (v != index + 1 && v <= A.length && v > 0) {
index = v - 1;
t = A[index];
A[index] = v;
v = t;
}
}
}
for (int i = 0; i < A.length; i++) {
if (A[i] != i + 1) {
return i + 1;
}
}
return A.length + 1;
}
}