扑克牌中的顺子 - 算法 Java 实现版

import java.util.Arrays;

public class PokerStraight {

    public static boolean isStraight(int[] nums) {
        Arrays.sort(nums);
        int jokerNum = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                jokerNum++;
                continue;
            }
            if (i > 0 && nums[i] == nums[i - 1]) {
                return false;
            }
        }
        return nums[4] - nums[jokerNum] < 5;
    }

    public static void main(String[] args) {
        int[] nums = {2, 3, 5, 6, 0}; // 示例输入，可根据实际情况修改
        boolean result = isStraight(nums);
        System.out.println("是否为顺子：" + result);
    }
}