leetcode 日经贴，Cpp code -First Missing Positive
2015-05-14 11:00
429 查看
First Missing Positive
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
int n = nums.size();
for (int i = 0; i < n; ++i) {
int v = nums[i];
if (v > 0 && v <= n) {
while (nums[v - 1] > 0 && nums[v - 1] <= n && nums[v - 1] != v) {
int t = nums[v - 1];
nums[v - 1] = v;
v = t;
}
nums[v - 1] = v;
}
}
int ret = n + 1;
for (int i = 0; i < n; ++i) {
if (nums[i] != i + 1) {
ret = i + 1;
break;
}
}
return ret;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode: 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 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)
- LeetCode First Missing Positive
- leetcode-41 First Missing Positive