-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathSolution.java
More file actions
73 lines (62 loc) · 1.38 KB
/
Copy pathSolution.java
File metadata and controls
73 lines (62 loc) · 1.38 KB
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
package computeGameState;
import java.util.HashMap;
import java.util.Map;
import java.util.Random;
public class Solution {
public static void main(String[] args) {
// génération d'un nombre >= 0 et < 5
Random r = new Random();
int n = r.nextInt(5);
int m = r.nextInt(5);
// int m = n;
System.out.println("P1 " + n);
System.out.println("P2 " + m);
String resultat = "";
if (n == m) {
resultat = egalite(n, "P1", "P2");
}
resultat = res("P1", n, "P2", m);
System.out.println(resultat);
}
public static String egalite(int n, String nameP1, String nameP2) {
String resultat = "";
switch (n) {
case 0:
resultat = nameP1 + " " + "0" + " - " + nameP2 + " " + "0";
case 1:
resultat = "15a";
break;
case 2:
resultat = "30a";
break;
case 3:
resultat = "DEUCE";
break;
default:
resultat = "DEUCE";
break;
}
return resultat;
}
public static String res(String nameP1, int n, String nameP2, int m) {
Map<Integer, String> res = new HashMap<>();
res.put(0, "0");
res.put(1, "15");
res.put(2, "30");
res.put(3, "40");
if (n <= 3 && m <= 3) {
return nameP1 + " " + res.get(n) + " - " + nameP2 + " " + res.get(m);
}
if (n > m) {
if (n - m == 1)
return nameP1 + " ADVANTAGE";
else
return nameP1 + " WINS";
} else {
if (m - n == 1)
return nameP2 + " ADVANTAGE";
else
return nameP2 + " WINS";
}
}
}