When multiple write cycles before, want to jump to the outermost layer, we all know that this break and continue it is "tasteless" ah, so, there is such a delightful wording:
for (int i = 0; i < 10; i++) { boolean breakFor = false; for (int j = 0; j < 10; j++) {if (j == 3) { breakFor = true; break; } } if (breakFor) { break; } }
Comparison of direct violence, and each floor has a disk access Man ah this is, that if the number of layers many points as you want to exhausted me ye,
Direct One day, when I saw her at first sight, you know, love love
label_i: for (int i = 0; i < 10; i++) { label_j: for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { System.out.println("i = " + i + ", j = " + j + ", k = " + k); if (k == 2) { continue label_j; } if (j == 2) { break label_j; } if (i == 2) { break label_i; } } } }
So elegant and generous, output is straightforward:
i = 0, j = 0, k = 0 i = 0, j = 0, k = 1 i = 0, j = 0, k = 2 i = 0, j = 1, k = 0 i = 0, j = 1, k = 1 i = 0, j = 1, k = 2 i = 0, j = 2, k = 0 i = 1, j = 0, k = 0 i = 1, j = 0, k = 1 i = 1, j = 0, k = 2 i = 1, j = 1, k = 0 i = 1, j = 1, k = 1 i = 1, j = 1, k = 2 i = 1, j = 2, k = 0 i = 2, j = 0, k = 0