java第一个缺失正数

import java.util.Arrays;
import java.util.Scanner;

public class Firstpostive {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
String line;
while (scan.hasNextLine()) {
line = scan.nextLine().trim();
// please write your code here
String[] array = line.split(",");
int a[]=new int[array.length];
for (int i = 0; i < array.length; i++) {
a[i] = Integer.parseInt(array[i]);
}
Arrays.sort(a);
int num=1;
bgm: for (int i = 0; i < array.length-1; i++) {
if(a[i+1]-a[i]!=1) {
num=a[i]+1;
if(num<=0) {num=a[i+1]+1;}
break bgm;}
else num=a[i+1]+1;}

        if(num<=0) {num=1;}
        System.out.println(num);
        // System.out.println("answer");
    }
}

}