LeetCodc

First Missing Positive

  Total Accepted: 18124  Total Submissions: 80060 My Submissions

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 class Solution {
    public int firstMissingPositive(int[] A) {
        if (A == null || A.length == 0) {
            return 1;
        }
        for (int i = 0; i < A.length; i++){
            if (A[i] != i + 1 && A[i] <= A.length && A[i] > 0 && A[i] != A[A[i] - 1]){
                swap (A, i, A[i] - 1);
                i--;
            }
            
        }
        for (int i = 0; i < A.length; i++) {
            if (A[i] != i + 1){
                return i+ 1;
            }
        }
        return A.length + 1;
        
    }
    void swap(int[] A, int left, int right){
        int temp = A[left];
        A[left] = A[right];
        A[right] = temp;
    }
}