[LeetCode] 41. First Missing Positive java
来源:互联网 发布:林立雯淘宝店名字 编辑:程序博客网 时间:2024/06/05 15:30
/**41. First Missing Positive * @param nums * @return 第一个缺少的正数 * O(n) */ public int firstMissingPositive(int[] nums) { int len = nums.length; if (nums == null || nums.length == 0) { return 1; } for (int i = 0; i < len; i++) { while (nums[i] != i+1) { if (nums[i] > nums.length || nums[i] <= 0 || nums[i] == nums[nums[i]-1]) break; int temp = nums[i]; nums[i] = nums[temp-1]; nums[temp-1] = temp; } } for (int i = 0; i < len; i++) { if (nums[i] != i+1) return i+1; } return nums.length+1; } //把元素放入正确的位置,例如1放在A[0],2放在A[1]... //桶排序思想,每次当A[i]!= i的时候,将A[i]与A[A[i]]交换,直到无法交换位置。终止条件是 A[i]== A[A[i]]。
0 0
- leetcode:41. First Missing Positive (Java)
- (Java)LeetCode-41. First Missing Positive
- [LeetCode] 41. First Missing Positive java
- [leetcode]41. First Missing Positive(Java)
- [Leetcode] First Missing Positive (Java)
- First Missing Positive - Java Leetcode
- [LeetCode][Java] First Missing Positive
- leetcode:First Missing Positive 【Java】
- LeetCode : First Missing Positive [java]
- leetcode:First Missing Positive (JAVA)
- [LeetCode]First Missing Positive(Java)
- [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
- listView多个布局复用
- c#学习笔记
- 图解GitHub和SourceTree入门教程
- 基于WCF的RESTFul WebAPI如何对传输内容实现压缩
- ActiveMQ简单介绍+简单实例
- [LeetCode] 41. First Missing Positive java
- IL指令
- oracle要掌握的程度
- POI之经典案例--按列名导出excel
- 【Java】《Java编程思想》笔记(含练习题答案代码)-第二章 一切都是对象
- maven dependency中scope=compile 和 provided区别
- runOnUiThread
- 如何定位生产问题
- [LeetCode] 75. Sort Colors java