Java 实现斗地主扑克牌排序

最新推荐文章于 2021-03-16 12:42:42 发布

aa80303857

最新推荐文章于 2021-03-16 12:42:42 发布

阅读量4k

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/aa80303857/article/details/69523346

这篇博客分享了如何使用Java编程实现斗地主游戏中扑克牌的排序算法，包括牌型判断和牌组排序的关键步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package com.yu.go;

import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class Day01 {

	
	private static Integer[] zp = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,
			18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,
			39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54};
	private static Map<Integer,String> mapN = new HashMap<>();
	
	public static void initMap (){
		mapN.put(1, "A%");		mapN.put(2, "A&");		mapN.put(3, "A#");		mapN.put(4, "A$");
		mapN.put(5, "2%");		mapN.put(6, "2&");		mapN.put(7, "2#");		mapN.put(8, "2$");
		mapN.put(9, "3%");		mapN.put(10, "3&");		mapN.put(11, "3#");		mapN.put(12, "3$");
		mapN.put(13, "4%");		mapN.put(14, "4&");		mapN.put(15, "4#");		mapN.put(16, "4$");
		mapN.put(17, "5%");		mapN.p