forked from menault/TD4_DEV51_Qualite_Algo
52 lines
1.2 KiB
Java
52 lines
1.2 KiB
Java
import java.util.Arrays;
|
|
|
|
public class exo3 {
|
|
private static int calculSomme(int[] ligne) {
|
|
int somme = 0;
|
|
for (int element : ligne) {
|
|
somme += element;
|
|
}
|
|
return somme;
|
|
}
|
|
|
|
public static int[][] trierTab(int[][] tab) {
|
|
Arrays.sort(tab, (val1, val2) -> Integer.compare(calculSomme(val1), calculSomme(val2)));
|
|
|
|
for (int[] val : tab) {
|
|
Arrays.sort(val);
|
|
}
|
|
|
|
return tab;
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
int[][] orginalTab = {
|
|
{0, 3, 2},
|
|
{9, 4, 5},
|
|
{4, 1, 3},
|
|
};
|
|
// int[][] orginalTab = {
|
|
// {7, 2, 9, 1},
|
|
// {3, 8, 4},
|
|
// {6, 1, 5, 2, 3},
|
|
// {2, 9},
|
|
// {4, 7, 1, 8},
|
|
// };
|
|
|
|
afficherTab(orginalTab);
|
|
System.out.println("-----");
|
|
|
|
int[][] resultTab = trierTab(orginalTab);
|
|
|
|
afficherTab(resultTab);
|
|
}
|
|
|
|
private static void afficherTab(int[][] tab) {
|
|
for (int i = 0; i < tab.length; i++) {
|
|
for (int j = 0; j < tab[i].length; j++) {
|
|
System.out.print(tab[i][j] + " ");
|
|
}
|
|
System.out.println();
|
|
}
|
|
}
|
|
} |