41. First Missing Positive
2017-09-24 13:03
204 查看
class Solution {
public int firstMissingPositive(int[] nums) {
int i=0;
while(i<nums.length)
{
if(nums[i]>0&&nums[i]<=nums.length&&nums[i]!=nums[nums[i]-1])
{
int tmp=nums[i];
nums[i]=nums[tmp-1];
nums[tmp-1]=tmp;
}
else
i++;
}
for(int j=0;j<nums.length;j++)
if(nums[j]!=j+1)
return j+1;
return nums.length+1;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 41. First Missing Positive Leetcode Python
- [LeetCode 41] First Missing Positive
- leetcode 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
- [leedcode 41] First Missing Positive
- leecode刷题 之 41 FirstMissingPositive
- 41. First Missing Positive
- 41 First Missing Positive
- （LeetCode 41）First Missing Positive
- [leetcode-41]First Missing Positive(java)
- 41. First Missing Positive
- LeetCode 41 First Missing Positive
- 【LeetCode OJ 41】First Missing Positive
- LeetCode 41 First Missing Positive
- 41 First Missing Positive
- 41. First Missing Positive