【leetcode】First Missing Positive
2015-04-24 22:53
302 查看
【leetcode】First Missing Positive
找第一个没有出现的正数，我感觉很简单啊，为什么是hard？我打算用一个数组把正数作为下表映射到数组中。然后么，直接遍历数组，找到第一个没出现的就ok。
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
if(nums.size()==0)
return 1;
bool *res;
res=new bool[nums.size()+2];
memset(res,false,nums.size()+2);
for(unsigned int nIndex=0;nIndex<nums.size();++nIndex)
if(nums[nIndex]>0)
res[nums[nIndex]]=true;
for(unsigned int nIndex=1;nIndex<nums.size()+2;++nIndex)
if(res[nIndex]==false)
{
delete res;
return nIndex;
}
delete res;
return 1;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode: First Missing Positive
- leetcode 日经贴，Cpp code -First Missing Positive
- [leetcode] First Missing Positive
- [LeetCode] 030: First Missing Positive
- 【Leetcode】First Missing Positive
- leetcode-First Missing Positive
- LeetCode（41）First Missing Positive
- LeetCode41/19 First Missing Positive/Remove Nth Node From End of List ****
- LeetCode | First Missing Positive（第一个缺失的正整数）
- Leetcode First Missing Positive
- LeetCode--first-missing-positive
- First Missing Positive - LeetCode 41
- leetcode problem 41 -- First Missing Positive
- LeetCode First Missing Positive
- LeetCode-First Missing Positive
- LeetCode-First Missing Positive
- [Leetcode 96] 41 First Missing Positive
- [leetcode]First Missing Positive
- Leetcode First Missing Positive
- [Leetcode] First Missing Positive (Java)