首页 > 代码库 > [LeetCode] First Missing Positive
[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.
在原数组A上将数组A中的数进行排序....时间复杂度O(n),空间复杂度O(1)
class Solution {public: int firstMissingPositive(int A[], int n) { if(n==0) return 1; for(int i=0;i<n;i++){ if(A[i] <= n && A[i]>0 && A[i] != i+1){ if(A[A[i]-1] != A[i]){ int tmp = A[A[i]-1]; A[A[i]-1] = A[i]; A[i] = tmp; i--; } } }//end for for(int i=0;i<n;i++){ if(A[i] != i+1) return i+1; } return n+1; }};
[LeetCode] First Missing Positive
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。