LeetCode----41. First Missing Positive

最新推荐文章于 2019-07-11 10:26:49 发布

nameix

最新推荐文章于 2019-07-11 10:26:49 发布

阅读量198

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/nameix/article/details/52776476

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

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

 
  Input: 
  [2]

 
  Output: 
  3

 
  Expected: 
  1

 
  Input: 
  [2,2]

 
  Output: 
  3

 
  Expected: 
  1

[1,2]-----3;[-1]----1;[1]-------2;[3]-------2;[2,2]-------1;[2,3,4]------1

思路：交换数组元素，使得数组中第i位存放数值(i+1)。最后遍历数组，寻找第一个不符合此要求的元素，返回其下标。整个过程需要遍历两次数组，复杂度为O(n)。

public class Solution {
 public int firstMissingPositive(int[] nums) {
     //不满足返回1
     if(nums.length<1){return 1;}
   for(int i=0;i<nums.length;i++){
       int j=i;
       while(j<nums.length&&nums[j]!=i+1){j++;}
       if(j<nums.length){nums[j]=nums[i];nums[i]=i+1;}//找到的话进行交换
       
    }
    for(int i=0;i<nums.length;i++){if(nums[i]!=i+1){return i+1;}}
    return nums.length+1;
    }

}

public class Solution {

    public int firstMissingPositive(int[] A) {
        if (A == null) {
            return 1;
        }

        for (int i = 0; i < A.length; i++) {
            while (A[i] > 0 && A[i] <= A.length && A[i] != (i+1)) {
                int tmp = A[A[i]-1];
                if (tmp == A[i]) {
                    break;
                }
                A[A[i]-1] = A[i];
                A[i] = tmp;
            }
        }

        for (int i = 0; i < A.length; i ++) {
                if (A[i] != i + 1) {
                    return i + 1;
                }
        }

        return A.length + 1;
    }
}