leetcode - First Missing Positive
Posted brucemengbm
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode - First Missing Positive相关的知识,希望对你有一定的参考价值。
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.
class Solution { public: int firstMissingPositive(int A[], int n) { int i,j; for(i=0;i<n;i++){ int cur=A[i]; if(cur==i+1||cur<=0||cur>n)continue; swap(A[i],A[cur-1]); if(A[i]!=A[cur-1]) i--; } for(i=0;i<n;i++) if(A[i]!=i+1) return i+1; return n+1; } };
以上是关于leetcode - First Missing Positive的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode题解-----First Missing Positive
LeetCode OJ 41First Missing Positive
leetcode First Missing Positive
LeetCode 41. First Missing Positive