1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54
|
package Code;
public class {
private static void printMatrix(int[][] matrix) { if (matrix == null || matrix.length <= 1 || matrix[0].length <= 1) { return; } int[] A = {0, 0}; int[] B = {matrix.length - 1, matrix[0].length -1}; while (B[0] >= A[0] && B[1] >= A[1]) { print(matrix,A[0]++,A[1]++,B[0]--,B[1]--); } }
private static void print(int[][] arr, int a, int b, int c, int d) { int index = b; while (index < d) { System.out.print(arr[a][index++] + " "); } index = a; while (index < c) { System.out.print(arr[index++][d] + " "); } index = d; while (index > b) { System.out.print(arr[c][index--] + " "); } index = c; while (index > a) { System.out.print(arr[index--][b]+" "); } }
public static void main(String[] args) { int[][] matrix = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 } }; ClockwisePrintMatrix.printMatrix(matrix); }
}
|
近期评论