Java_上机3

发表于 | 分类于 ， ， |
字数统计: | 阅读时长 ≈

卡牌创建、打乱、整理小软件

题目要求

  1. 以面向对象方式写一个“卡牌操作”类：CardOperator

  2. 具有以下功能（类似扑克的功能，具体解释见后续ppt）：

    • 功能1：初始化卡牌，initialCards（）
    • 功能3：洗牌（将牌打乱），shuffleCards（）
    • 功能4：理牌（重新排序），rankCards（）

  3. 写一个主控程序：MainProcess类（包含main函数）

    调用CardOperator完成各种卡牌操作

    MainProcess类如右图（直接copy即可）

    输出结果如下页ppt所示

文件下载

下载文件

具体代码

MainProcess.java

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
public class MainProcess {
    public static void main(String[] args) {
        int cardNum = 2; //定义牌的张数
        CardOperator card = new CardOperator(cardNum);
        System.out.println("卡牌初始化:");
        card.showCards();

        System.out.println("卡牌打乱后:");
        card.shuffleCards();
        card.showCards();

        System.out.println("卡牌理牌后:");
        card.rankCards();
        card.showCards();
    }
}

cardOperator.java

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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
public class CardOperator {
    private int num_per_cards = 52; //每副卡牌的数量
    private int cards_num;          //一共几副牌
    private static int [][] cards;         //卡牌组数，例如三副牌，就是3*52的二维矩阵

    public CardOperator(int user_input_cards_num){
        //接受几副牌的信息
        cards_num = user_input_cards_num;
        initialCards();
    }

    public void initialCards(){
        //每副牌都按照黑桃红桃、方片、草花,A-K的顺序初始化
        //系统认定先是13张黑桃，再13张红桃A-K，再13张方片A-K，最后13张草花A-K
        cards = new int[cards_num][num_per_cards];
        for (int i = 0; i < cards_num; i++) {
            for (int j = 0; j < num_per_cards; j++) {
                cards[i][j] = j+i*num_per_cards;
            }
        }
    }
    public void showCards(){
        //依次显示每副牌的牌面
        String card_type; //牌型: 花色
        String card_value; //牌值
        for (int i = 0; i < cards_num; i++) {
            System.out.println("第"+(i+1)+"副牌:");
            for (int j = 0; j < num_per_cards; j++) {
                card_type = getCardType(j+i*num_per_cards);
                card_value = getCardValue(j+i*num_per_cards);
                System.out.print(card_type+card_value+",");
                if((j+1) % 13 == 0){
                    System.out.println();
                }
            }
            System.out.println();
        }
    }

    //获取牌的花色
    private static String getCardType(int card_info){
        String card_type = null;
        int type;
        type = (cards[card_info/52][card_info%52]%52)/13;
        switch (type){
            case 0:
                card_type = "黑桃";
                break;
            case 1:
                card_type = "红桃";
                break;
            case 2:
                card_type = "方片";
                break;
            case 3:
                card_type = "梅花";
                break;
        }
        return card_type;
    }

    //获取牌的数值
    private static String getCardValue(int card_info){
        String card_value;
        int value;
        value = (cards[card_info/52][card_info%52]+1) % 13;
        switch (value){
            case 1:
                card_value = "A";
                break;
            case 2:
                card_value = "2";
                break;
            case 3:
                card_value = "3";
                break;
            case 4:
                card_value = "4";
                break;
            case 5:
                card_value = "5";
                break;
            case 6:
                card_value = "6";
                break;
            case 7:
                card_value = "7";
                break;
            case 8:
                card_value = "8";
                break;
            case 9:
                card_value = "9";
                break;
            case 10:
                card_value = "10";
                break;
            case 11:
                card_value = "Jack";
                break;
            case 12:
                card_value = "Queen";
                break;
            case 0:
                card_value = "King";
                break;
            default:
                card_value = "wrong";
        }
        return  card_value;
    }

    //对单独的每一副牌进行打乱
    public void shuffleCards(){
        int shuffle_num = 100; //打乱100次
        int first_index,second_index;//用于交换位置的两个元素的下标
        int temp; //用于交换时候的临时变量
        for (int i = 0; i < cards_num; i++) {
            for (int j = 0; j < shuffle_num; j++) {
                first_index = (int) (Math.random()*(num_per_cards-1));
                second_index = (int) (Math.random()*(num_per_cards-1));
                temp = cards[i][first_index];
                cards[i][first_index] = cards[i][second_index];
                cards[i][second_index] = temp;
            }
        }
    }

    //对每一副牌进行排序
    public void rankCards(){
        for (int i = 0; i < cards_num; i++) {
            quick_sort(cards[i],0, num_per_cards-1);
        }
    }

    //排序具体方法采用快速排序法
    private void quick_sort(int [] array, int l, int r){
        int head = l;
        int tail = r;
        while (head < tail) {
            while (head < tail) {
                if (array[l] <= array[tail]) {
                    tail--;
                } else {
                    break;
                }
            }
            while (head < tail) {
                if (array[l] >= array[head]) {
                    head++;
                } else {
                    break;
                }
            }
            if (head < tail) {
                int temp;
                temp = array[head];
                array[head] = array[tail];
                array[tail] = temp;
            } else if (head == tail) {
                int temp;
                temp = array[head];
                array[head] = array[l];
                array[l] = temp;
                quick_sort(array, l, head - 1);
                quick_sort(array, head + 1, r);
                break;

            } else {
                System.out.println("发生错误");
            }
        }
    }

}