剑指 Offer 61. 扑克牌中的顺子

package leetcode;

import java.util.Arrays;

public class offer_61 {
    public boolean isStraight(int[] nums) {
        //先进行排序
        Arrays.sort(nums);
        int count=0;
        for(int i=0;i<nums.length-1;i++) {
            //记录出现0的个数
            if(nums[i]==0) {
                count++;
                continue;
            }
            //非0重复则为不连续
            if(nums[i]==nums[i+1]) {return false;}
            //判断当前0元素的个数是否能抵消差值
            count=count-(nums[i+1]-nums[i])+1;
            //0元素个数不能抵消差值
            if(count<0) {return false;}
        }
        return true;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        offer_61 off=new offer_61();
        int[] nums= {0,0,1,2,5};
        System.out.println(off.isStraight(nums));
    }

}