缺失的第一个正整数

package leetcode;

import java.util.Arrays;

public class FirstMissShuSolution {
    int firstMissShu(int[] nums){
        if(nums == null){
            return 1;
        }
        Arrays.sort(nums);

        int compare = 0 ;
        for(int i=0 ;i < nums.length; i++){
            if(nums[i] <= 0 ){
                continue;
            }
            if(i > 0 && nums[i-1] == nums[i]){
                continue;
            }
            compare++;
            if(compare < nums[i]){
                return  compare;
            }
        }
        return compare+1;
    }
    public static void main(String[] args){
        int[] nums={0,-1,-2,2,3,4,5,6,78};
        int n = new FirstMissShuSolution().firstMissShu(nums);
        System.out.println(n);
    }
}