forked from menault/TD4_DEV51_Qualite_Algo
30 lines
652 B
Java
30 lines
652 B
Java
|
import java.util.Arrays;
|
||
|
import java.util.Comparator;
|
||
|
|
||
|
public class TriTableauND {
|
||
|
|
||
|
public static void main(String[] args) {
|
||
|
int[][] tableau = { {0,3,2}, {9,4,5}, {4,1,3} };
|
||
|
|
||
|
trier2D(tableau);
|
||
|
|
||
|
for (int[] ligne : tableau) {
|
||
|
System.out.println(Arrays.toString(ligne));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static void trier2D(int[][] tab) {
|
||
|
|
||
|
for (int[] ligne : tab) {
|
||
|
Arrays.sort(ligne);
|
||
|
}
|
||
|
Arrays.sort(tab, Comparator.comparingInt(TriTableauND::somme));
|
||
|
}
|
||
|
|
||
|
public static int somme(int[] t) {
|
||
|
int s = 0;
|
||
|
for (int val : t) s += val;
|
||
|
return s;
|
||
|
}
|
||
|
}
|