
import java.util.Arrays

/**
 * 100/100
 * @param A
 * @return
 */
fun solution(A: IntArray): Int {
    var smallest = 1
    Arrays.sort(A)
    for (i in A.indices) {
        if (A[i] > 0 && A[i] == smallest) {
            smallest++
        } else if (A[i] > smallest) {
            return smallest
        }
    }
    return smallest
}

/**

Write a function:

fun solution(A: IntArray): Int

that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.

For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

Given A = [−1, −3], the function should return 1.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];
each element of array A is an integer within the range [−1,000,000..1,000,000].

 */

import java.util.Arrays

/**
 * 100/100
 * @param A
 * @return
 */
fun solution(A: IntArray): Int {
    var smallest = 1
    Arrays.sort(A)
    for (i in A.indices) {
        if (A[i] > 0 && A[i] == smallest) {
            smallest++
        } else if (A[i] > smallest) {
            return smallest
        }
    }
    return smallest
}

/**

Write a function:

fun solution(A: IntArray): Int

that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.

For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

Given A = [−1, −3], the function should return 1.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];
each element of array A is an integer within the range [−1,000,000..1,000,000].

 */