41. First Missing Positive
2018-03-13 00:31
239 查看
此题注意到数组中的元素与数组下标的关系。
public class Solution {
public int firstMissingPositive(int[] A) {
int i = 0;
while(i < A.length){
if(A[i] == i+1 || A[i] <= 0 || A[i] > A.length) i++;
else if(A[A[i]-1] != A[i]) swap(A, i, A[i]-1);
else i++;
}
i = 0;
while(i < A.length && A[i] == i+1) i++;
return i+1;
}
private void swap(int[] A, int i, int j){
int temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
相关文章推荐
- [Leetcode]_41 First Missing Positive
- leetcode 41 First Missing Positive
- leecode刷题 之 41 FirstMissingPositive
- 41. First Missing Positive
- LeetCode41/19 First Missing Positive/Remove Nth Node From End of List ****
- LeetCode(41)First Missing Positive
- 41 First Missing Positive
- 41. First Missing Positive
- [*leetcode 41] First Missing Positive
- [leetcode 41] First Missing Positive
- 41. First Missing Positive
- LeetCode(41)First Missing Positive
- LeetCode 41 First Missing Positive
- 【LeetCode OJ 41】First Missing Positive
- 41 First Missing Positive
- 41. First Missing Positive
- 41. First Missing Positive
- 41. First Missing Positive
- LeetCode_41---First Missing Positive
- 41. First Missing Positive