1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
| // full
public static int[] fUll() {
//int [][] full = new int[5] [24];
int [][] full ={{6,6,6,5,5},{6,6,6,4,4},{6,6,6,3,3},{6,6,6,2,2},{6,6,6,1,1},{6,6,5,5,5},{5,5,5,4,4},{5,5,5,3,3},{5,5,5,2,2},{5,5,5,1,1},
{6,6,4,4,4},{5,5,4,4,4},{4,4,4,3,3},{4,4,4,2,2},{4,4,4,1,1},{6,6,3,3,3},{5,5,3,3,3},{4,4,3,3,3},{3,3,3,2,2},{3,3,3,1,1},{6,6,2,2,2},
{5,5,2,2,2},{4,4,2,2,2},{3,3,2,2,2,},{2,2,2,1,1}};
int [] point = {83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59};
for (int i=0; i<5; i++){
for (int j=0; j<24; j++){
if (tiRage [i] == full [i][j]){
System.out.println("full" + "point : " + point[i]);
trouve_full=true;
}
else {
System.out.println("pas de full");
}
}
}
return (tiRage);
} |
Partager