LeetCode-面试题61-扑克牌中的顺子

输入: [1,2,3,4,5]
输出: True

输入: [0,0,1,2,5]
输出: True

class Solution {
    public boolean isStraight(int[] nums) {
        if(nums==null||nums.length<=0)
            return false;
        Arrays.sort(nums);
        int zeroCount = 0;
        int gapCount = 0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]==0)
                zeroCount++;
        }
        int start = zeroCount;
        int end = start+1;
        while(end<nums.length){
            if(nums[start]==nums[end])
                return false;
            gapCount+=nums[end]-nums[start]-1;
            start=end;
            end++;
        }
        return (gapCount>zeroCount)?false:true;
    }
}