Java : Collection Sort Test

Question

This is a demo task.

Write a function:

class Solution { public int solution(int[] A); }

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].

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

Solution

    public static int solution(int[] A) {

        // write your code in Java SE 8

        Arrays.sort(A);

        int currentInt = 1;

        for (int a : A){

            if(a < currentInt){

                //do Nothing

            } else if(a == currentInt){

                currentInt++;

            } else if(a > currentInt){

                return currentInt;

            }

        }

        

        return currentInt;

    }

Link: https://www.jdoodle.com/a/K8J