MCPcopy Create free account
hub / github.com/algorithmzuo/algorithm-journey / print

Method print

src/class098/Code02_BigShow.java:75–88  ·  view source on GitHub ↗
(int[][] m)

Source from the content-addressed store, hash-verified

73
74 // 打印二维矩阵
75 public static void print(int[][] m) {
76 for (int i = 0; i < m.length; i++) {
77 for (int j = 0; j < m[0].length; j++) {
78 if (m[i][j] < 10) {
79 System.out.print(m[i][j] + " ");
80 } else if (m[i][j] < 100) {
81 System.out.print(m[i][j] + " ");
82 } else {
83 System.out.print(m[i][j] + " ");
84 }
85 }
86 System.out.println();
87 }
88 }
89
90 // 矩阵乘法的展示
91 public static void f1() {

Callers 15

f1Method · 0.95
f2Method · 0.95
f3Method · 0.95
f4Method · 0.95
preOrderMethod · 0.45
inOrderMethod · 0.45
posOrderTwoStacksMethod · 0.45
posOrderOneStackMethod · 0.45
mainMethod · 0.45
mainMethod · 0.45
mainMethod · 0.45
preOrderMethod · 0.45

Calls 1

printlnMethod · 0.45

Tested by

no test coverage detected