Codility Distinct problem - Java Solution

Solution.java

import java.util.Arrays;

/**
 * Created by mateus marquezini on 09-09-2016.
 */
public class Solution {

  public int solution(int[] A) {

	int count = 1;
	final int fim = A.length - 1;

	Arrays.sort(A);

	if (A.length == 0) {
	    return 0;
	}

	if (A.length == 1) {
	    return 1;
	}

	for (int i = 0; i < A.length - 1; i++) {
	    if (A[i] != A[i + 1]) {
	        count++;
	    }
	}

	return count;
  }
}