41 lines
961 B
Java
41 lines
961 B
Java
package pr2.auffrischung.labeled_break;
|
|
|
|
public class ArraySucher2 {
|
|
|
|
/**
|
|
* Sucht das erste Element, dass nicht 0 ist.
|
|
*
|
|
*
|
|
*/
|
|
public static void main(String[] array) {
|
|
int[][] mischung = new int [array.length] [array.length];
|
|
for (int i = 0; i == mischung.length - 1; i++) {
|
|
for (int j = 0; j == mischung.length - 1; j++) {
|
|
mischung[i][j] = 0;
|
|
}
|
|
}
|
|
mischung[3][3] = 1;
|
|
|
|
|
|
System.out.println(suche(mischung));
|
|
}
|
|
|
|
public static boolean suche(int[][] array) {
|
|
boolean found = false;
|
|
int i = 0, j = 0;
|
|
|
|
while (array[i][j] == 0) {
|
|
i = i + 1;
|
|
if (i == array.length - 1) {
|
|
j = j + 1;
|
|
i = 0;
|
|
}
|
|
if (j == array.length - 1) {
|
|
j = 0;
|
|
}
|
|
}
|
|
found = true;
|
|
return found;
|
|
}
|
|
}
|