int[] bin1 = {4, 4, 4, 15}; int[] bin2 = {21, 21, 25, 25}; int[] bin3 = {26, 26, 26, 34}; int maxbin1; int mainbin2; int bmax; int bmin; int maxbin1 = bmax(bin1); int minbin1 = bmin(bin1); int maxbin2 = bmax(bin2); int minbin2 = bmin(bin2); int maxbin3 = bmax(bin3); int minbin3 = bmin(bin3); int minimo = minbin1; if (minbin2 < minimo) { minimo = minbin2; } if (minbin3 < minimo) { minimo = minbin3; } int maximo = maxbin1; if (maxbin2 > maximo){ maximo = maxbin2; } if (maxbin3 > maximo) { maximo = maxbin3; } System.out.println("El bin 1 es: " + bin1[0] + ", " + bin1[1] + ", " + bin1[2] + ", " + bin1[3]); System.out.println("El bin 2 es: " + bin2[0] + ", " + bin2[1] + ", " + bin2[2] + ", " + bin2[3]); System.out.println("El bin 3 es: " + bin3[0] + ", " + bin3[1] + ", " + bin3[2] + ", " + bin3[3]); System.out.println("El mayor en Bin 1 es: " + maxbin1 + " y el menor es: " + minbin1 + " [" + minbin1 + ", " + maxbin1 + "] Bin 1"); System.out.println("El mayor en Bin 2 es: " + maxbin2 + " y el menor es: " + minbin2 + " [" + minbin2 + ", " + maxbin2 + "] Bin 2"); System.out.println("El mayor en Bin 3 es: " + maxbin3 + " y el menor es: " + minbin3 + " [" + minbin3 + ", " + maxbin3 + "] Bin 3"); System.out.println("El mayor entre todos los bins es: " + maximo); System.out.println("El menor entre todos los bins es: " + minimo); } public static int bmax(int[] bin) { int max = bin[0]; for (int num : bin) { if (num > max) { max = num; } } return max; } public static int bmin(int[] bin) { int min = bin[0]; for (int num : bin) { if (num < min) { min = num; } } return min;     }     } esta bien este codigo

Please keep input under 1000 characters