LeetCode:First Missing Positive

最新推荐文章于 2019-01-13 06:58:39 发布

walker lee

最新推荐文章于 2019-01-13 06:58:39 发布

阅读量1.6k

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Array

本文链接：https://blog.csdn.net/itismelzp/article/details/51685537

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

First Missing Positive

Total Accepted: 66680 Total Submissions: 277290 Difficulty: Hard

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.

Subscribe to see which companies asked this question

Hide Tags

Array

Hide Similar Problems

(M) Missing Number (H) Find the Duplicate Number

思路：

将每个数放置到下标对应的位置。

如num=5,将它与nums[4]位置上的数交换；第二次遍历数组，第一个没与位置对应的数即为答案。

java code:

public class Solution {
    public int firstMissingPositive(int[] nums) {
        
        int n = nums.length;
        for(int i=0;i<n;i++) {
            while(0 < nums[i] && nums[i] <= n && nums[nums[i]-1] != nums[i])
                swap(nums, nums[i]-1,i);
        }
        for(int i=0;i<n;i++) {
            if(nums[i] != i+1) return i+1;
        }
        return n+1;
    }
    
    // 自定义函数：交换
    private void swap(int[] nums, int i, int j) {
		nums[i] ^= nums[j];
		nums[j] ^= nums[i];
		nums[i] ^= nums[j];
    }
}