Solution (100%) to Distinct problem on Codility (https://codility.com/programmers/task/distinct/)

Distinct.java

/*
 * EASIEST TEST OF ALL SO FAR...
 */
 
import java.util.*;

class Solution
{
    public int solution(int[] A)
    {
        TreeSet<Integer> distinctValues = new TreeSet<Integer>();
        
        for (int i = 0; i < A.length; i++)
        {
            distinctValues.add(A[i]);
        }
        
        return distinctValues.size();
    }
}