Determine if a set of cards (represented by int values) has a full house in linear time

Main.java

public static boolean hasFullHouse(int[] arrIn) {
	int[] count = new int[13];
	int two = 0,
	threeOrGreater = 0;
	for (int i = 0; i < arrIn.length; i++) {
		count[arrIn[i] - 1]++;
	}
	for (int i = 0; i < 13; i++) {
		if (count[i] == 2) {
			two++;
		} else if (count[i] >= 3) {
			threeOrGreater++;
		}

	}
	return threeOrGreater >= 2 || (two >= 1 && threeOrGreater >= 1);
}