質問編集履歴
1
ソースコード全文記載しました。
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
学校のJavaの課題でプログラムを作成しています。
|
|
1
|
+
学校のJavaの課題でプログラムを作成しています。53枚のトランプカードをランダムに表示させるプログラムです。
|
|
2
2
|
|
|
3
3
|
このエラーが解決できません。配列の中に入っている値を変数に代入することはできないのでしょうか？
|
|
4
4
|
|
|
@@ -20,6 +20,62 @@
|
|
|
20
20
|
|
|
21
21
|
---
|
|
22
22
|
|
|
23
|
+
import java.util.Random;
|
|
24
|
+
|
|
25
|
+
public class repo06_3a{
|
|
26
|
+
|
|
27
|
+
public static void main(String[] args){
|
|
28
|
+
|
|
29
|
+
|
|
30
|
+
|
|
31
|
+
int[] n = {1,2,3,4,5,6,7,8,9,10,11,12,13};
|
|
32
|
+
|
|
33
|
+
String[] m = {"Spade","Heart","Club","Diamond","JOKER"};
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
|
|
37
|
+
Random rnd = new Random();
|
|
38
|
+
|
|
39
|
+
int num = 0;
|
|
40
|
+
|
|
41
|
+
int[] s = new int[52];
|
|
42
|
+
|
|
43
|
+
int card = 0;
|
|
44
|
+
|
|
45
|
+
String mark = "";
|
|
46
|
+
|
|
47
|
+
|
|
48
|
+
|
|
49
|
+
for(int i = 0; i < 52; i++){
|
|
50
|
+
|
|
51
|
+
num = rnd.nextInt(52)+1;
|
|
52
|
+
|
|
53
|
+
for(int j = 0; j <= i; j++){
|
|
54
|
+
|
|
55
|
+
if(s[j] == num){
|
|
56
|
+
|
|
57
|
+
break;
|
|
58
|
+
|
|
59
|
+
}else{
|
|
60
|
+
|
|
61
|
+
s[j] = num;
|
|
62
|
+
|
|
63
|
+
mark = check1(String.valueOf(num));
|
|
64
|
+
|
|
65
|
+
card = check2(num);
|
|
66
|
+
|
|
67
|
+
System.out.println(mark + " " + card);
|
|
68
|
+
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
|
|
78
|
+
|
|
23
79
|
public static String check1(String M){
|
|
24
80
|
|
|
25
81
|
|
|
@@ -62,6 +118,98 @@
|
|
|
62
118
|
|
|
63
119
|
}
|
|
64
120
|
|
|
121
|
+
|
|
122
|
+
|
|
65
|
-
|
|
123
|
+
public static int check2(int N){
|
|
124
|
+
|
|
125
|
+
|
|
126
|
+
|
|
127
|
+
switch(N % 13){
|
|
128
|
+
|
|
129
|
+
case 0:
|
|
130
|
+
|
|
131
|
+
N = n[12];
|
|
132
|
+
|
|
133
|
+
break;
|
|
134
|
+
|
|
135
|
+
case 1:
|
|
136
|
+
|
|
137
|
+
N = n[0];
|
|
138
|
+
|
|
139
|
+
break;
|
|
140
|
+
|
|
141
|
+
case 2:
|
|
142
|
+
|
|
143
|
+
N = n[1];
|
|
144
|
+
|
|
145
|
+
break;
|
|
146
|
+
|
|
147
|
+
case 3:
|
|
148
|
+
|
|
149
|
+
N = n[2];
|
|
150
|
+
|
|
151
|
+
break;
|
|
152
|
+
|
|
153
|
+
case 4:
|
|
154
|
+
|
|
155
|
+
N = n[3];
|
|
156
|
+
|
|
157
|
+
break;
|
|
158
|
+
|
|
159
|
+
case 5:
|
|
160
|
+
|
|
161
|
+
N = n[4];
|
|
162
|
+
|
|
163
|
+
break;
|
|
164
|
+
|
|
165
|
+
case 6:
|
|
166
|
+
|
|
167
|
+
N = n[5];
|
|
168
|
+
|
|
169
|
+
break;
|
|
170
|
+
|
|
171
|
+
case 7:
|
|
172
|
+
|
|
173
|
+
N = n[6];
|
|
174
|
+
|
|
175
|
+
break;
|
|
176
|
+
|
|
177
|
+
case 8:
|
|
178
|
+
|
|
179
|
+
N = n[7];
|
|
180
|
+
|
|
181
|
+
break;
|
|
182
|
+
|
|
183
|
+
case 9:
|
|
184
|
+
|
|
185
|
+
N = n[8];
|
|
186
|
+
|
|
187
|
+
break;
|
|
188
|
+
|
|
189
|
+
case 10:
|
|
190
|
+
|
|
191
|
+
N = n[9];
|
|
192
|
+
|
|
193
|
+
break;
|
|
194
|
+
|
|
195
|
+
case 11:
|
|
196
|
+
|
|
197
|
+
N = n[10];
|
|
198
|
+
|
|
199
|
+
break;
|
|
200
|
+
|
|
201
|
+
case 12:
|
|
202
|
+
|
|
203
|
+
N = n[11];
|
|
204
|
+
|
|
205
|
+
break;
|
|
206
|
+
|
|
207
|
+
}
|
|
208
|
+
|
|
209
|
+
return N;
|
|
210
|
+
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
}
|
|
66
214
|
|
|
67
215
|
---
|