Loading

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

class Solution {
    public boolean isStraight(int[] nums) {
        int joker = 0;
        Arrays.sort(nums);
        for(int i = 0; i < 4; i ++){
            if(nums[i] == 0) joker ++;
            else if(nums[i] == nums[i+1]) return false;
        }
        return nums[4] - nums[joker] < 5;
    }
}
posted @ 2021-04-19 14:33  想用包子换论文  阅读(47)  评论(0)    收藏  举报