leetCode 41. First Missing Positive
来源:互联网 发布:ubuntu 开启ssh服务 编辑:程序博客网 时间:2024/05/01 13:16
41. 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.
public int firstMissingPositive(int[] nums) { for(int i=0;i<nums.length;i++){ while(nums[i]!=i+1){ if(nums[i]>=1 && nums[i]<=nums.length && nums[i]!=nums[nums[i]-1]){ int tmp=nums[i]; nums[i]=nums[nums[i]-1]; nums[tmp-1]=tmp; }else{ break; } } } for(int i=0;i<nums.length;i++){ if(nums[i]!=i+1) return i+1; } return nums.length+1; }
1 0
- [LeetCode]41.First Missing Positive
- LeetCode --- 41. First Missing Positive
- LeetCode 41.First Missing Positive
- [Leetcode] 41. First Missing Positive
- [leetcode] 41.First Missing Positive
- leetCode 41. First Missing Positive
- LeetCode 41. First Missing Positive
- leetcode 41. First Missing Positive
- Leetcode 41. First Missing Positive
- LeetCode 41. First Missing Positive
- [leetcode]41. First Missing Positive
- LeetCode-41.First Missing Positive
- leetcode 41. First Missing Positive
- [LeetCode] 41. First Missing Positive
- [LeetCode]--41. First Missing Positive
- leetcode 41. First Missing Positive
- leetcode 41.First Missing Positive
- leetcode 41. First Missing Positive
- Cooja中有关collect-view插件
- TCP/IP复习笔记(二)
- VMware虚拟机无法识别U盘解决方案
- GZOI爆零(?)记
- 项目1-使用默认参数构造函数
- leetCode 41. First Missing Positive
- PCL环境搭配 (PCL1.7.2+WIN8.1+VS2015)
- 构建之法读后感
- 剖析NodeJs的事件轮询机制
- Collect View
- StringUtils中 isNotEmpty 和isNotBlank的区别
- 向量vector
- HDU4012 Paint on a Wall(BFS)
- leetcode118. Pascal's Triangle