First Missing Positive
来源:互联网 发布:qq影音mac官方下载 编辑:程序博客网 时间:2024/06/06 17:40
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.
题目主要是,要寻找1,2,...n,第一个没有的正整数。 所有用map,一下找到了。 另外hash代表什么意思?用哈希?
class Solution {public:int firstMissingPositive(vector<int>& nums) {if(nums.size()==0)return 1;map<int,int> mValue;int i;for(i=0;i<nums.size();i++){ mValue[nums[i]]=nums[i];}map<int,int>::iterator it;for(i=0;i<nums.size();i++){it=mValue.find(i+1);if(it==mValue.end())return i+1;}return i+1;}};
如果有不对,请批评指正,谢谢!
0 0
- LeetCode: First Missing Positive
- LeetCode First Missing Positive
- LeetCode: First Missing Positive
- [Leetcode] First Missing Positive
- leetcode12: First Missing Positive
- First Missing Positive
- [LeetCode] First Missing Positive
- [Leetcode] First Missing Positive
- leetcode First Missing Positive
- LeetCode First Missing Positive
- [leetcode] first missing positive
- First Missing Positive
- LeetCode: First Missing Positive
- First Missing Positive
- First Missing Positive
- [LeetCode]First Missing Positive
- First Missing Positive
- First Missing Positive
- Type Java compiler level does not match the version of the instalj解决方案
- 生成函数小结
- 浅谈算法和数据结构: 一 栈和队列
- Android中visibility属性VISIBLE、INVISIBLE、GONE的区别
- php5中的clone 浅拷贝 深拷贝
- First Missing Positive
- poj 3061 尺取法
- 驯裁轮菊干站沉胖屑倏轿腋烈呕夹
- #笔记#圣思园 JavaWeb 第65讲——jQuery,选择器
- map 用法详解
- hdu 1575 try a 矩阵快速幂
- BadParcelableException:Parcelable protocol requires a Parcelable 错误
- 九度OJ 题目1031:xxx定律
- session与cookie的区别