LeetCode进阶之路( First Missing Positive)
来源:互联网 发布:剑网3捏脸数据女 编辑:程序博客网 时间:2024/04/30 21:10
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.
题目:在一个无序的数组中找出第一题个缺少的正整数。
思路:因为空间复杂度要求是O(n)以及不能新增新的数组。所以思路是先排序,然后从小开始遍历,遇到第一个就输出就行了,但是要注意这个数组是可以重复的,一开始没注意这个限制条件。
public int firstMissingPositive(int[] nums) { if(nums.length == 0) {return 1;}Arrays.sort(nums);int j = 1;for(int i = 0;i < nums.length;i++) {if(nums[i] > 0) {if(nums[i] != j) {return j;} else if(i < nums.length-1 && nums[i] != nums[i+1]) {//排除重复的数字j++;}}}return nums[nums.length-1]+1;}
0 0
- LeetCode进阶之路( First Missing Positive)
- leetcode之路041 First Missing Positive
- LeetCode 之 First Missing Positive
- LeetCode之First Missing Positive
- leetcode之First Missing Positive
- LeetCode之First Missing Positive
- 【Leetcode】之First Missing Positive
- Leetcode之first missing positive
- LeetCode 之 First Missing Positive
- [LeetCode]First Missing Positive(!!!)
- LeetCode: First Missing Positive
- LeetCode First Missing Positive
- LeetCode: First Missing Positive
- [Leetcode] First Missing Positive
- [LeetCode] First Missing Positive
- [Leetcode] First Missing Positive
- leetcode First Missing Positive
- LeetCode First Missing Positive
- 8/7排位赛,codeforces501
- tomacat修改编码等问题
- Ehcache缓存(一)
- Android 学习导航
- missForest一种非参数的缺失值填补方法
- LeetCode进阶之路( First Missing Positive)
- MIT License探讨
- JS对象及其方法-Date
- 安卓第三方支付之银联支付
- 【44】翻转单词顺序列
- 根据银行卡账号获取所属银行php代码
- java中Map
- 数论 知识概念梳理
- leetcode题目整理