题解 | #扑克牌顺子#

import java.util.*;
public class Solution {
    public boolean IsContinuous(int [] numbers) {
        if(numbers == null || numbers.length != 5) {
            return false;
        }
        Arrays.sort(numbers);
        int cnt0 = 0;
        if(numbers[0] == 0) {
            cnt0 = 1;
        }
        for(int i = 1; i < 5; i++) {
            if(numbers[i] == 0) {
                cnt0++;
                continue;
            }
            if(numbers[i] == numbers[i - 1]) {
                return false;
            }
        }
        int min = numbers[cnt0], max = numbers[4];
        return max - min - 4 <= 0;
    }
}