[LeetCode] First Missing Positive

来源:互联网 发布:域名哪个好 编辑:程序博客网 时间:2024/06/16 16:54
int firstMissingPositive(int A[], int n) {for(int i = 0; i < n; ) {if(A[i] <= 0 || A[i] > n || A[A[i]-1] == A[i])i++;elseswap(A[i], A[A[i]-1]);}for(int i = 0; i < n; ) {if(A[i] == i+1)i++;elsereturn i+1;}return n+1;}

0 0
原创粉丝点击