import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;
public class Demo05 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = 0;
TreeSet<Integer> set1 = new TreeSet<>();
TreeSet<String> set2 = new TreeSet<>();
HashMap<Integer,Integer> map = new HashMap<>();
while(n < 5){
int p;
String s;
String pStr;
pStr = sc.next();
s = sc.next();
if(pStr.equals("J"
德州扑克判断牌型的代码(原创)
最新推荐文章于 2025-05-29 14:22:16 发布