modify code

algorithmzuo · algorithmzuo · commit d3e0308cd176 · 2024-01-17T14:10:19.000+08:00
diff --git a/src/class098/Code02_FibonacciNumber.java b/src/class098/Code02_FibonacciNumber.java
@@ -36,6 +36,7 @@ public static int fib2(int n) {
 		return m[0][0];
 	}
 
+	// 矩阵快速幂
 	public static int[][] power(int[][] m, int p) {
 		int n = m.length;
 		int[][] ans = new int[n][n];
@@ -51,6 +52,8 @@ public static int[][] power(int[][] m, int p) {
 		return ans;
 	}
 
+	// 矩阵相乘
+	// a的列数一定要等于b的行数
 	public static int[][] multiply(int[][] a, int[][] b) {
 		int n = a.length;
 		int m = b[0].length;
diff --git a/src/class098/Code03_ClimbingStairs.java b/src/class098/Code03_ClimbingStairs.java
@@ -22,6 +22,7 @@ public static int climbStairs(int n) {
 		return m[0][0] + m[1][0];
 	}
 
+	// 矩阵快速幂
 	public static int[][] power(int[][] m, int p) {
 		int n = m.length;
 		int[][] ans = new int[n][n];
@@ -37,6 +38,8 @@ public static int[][] power(int[][] m, int p) {
 		return ans;
 	}
 
+	// 矩阵相乘
+	// a的列数一定要等于b的行数
 	public static int[][] multiply(int[][] a, int[][] b) {
 		int n = a.length;
 		int m = b[0].length;
diff --git a/src/class098/Code04_TribonacciNumber.java b/src/class098/Code04_TribonacciNumber.java
@@ -24,6 +24,7 @@ public static int tribonacci(int n) {
 		return m[0][0] + m[1][0];
 	}
 
+	// 矩阵快速幂
 	public static int[][] power(int[][] m, int p) {
 		int n = m.length;
 		int[][] ans = new int[n][n];
@@ -39,6 +40,8 @@ public static int[][] power(int[][] m, int p) {
 		return ans;
 	}
 
+	// 矩阵相乘
+	// a的列数一定要等于b的行数
 	public static int[][] multiply(int[][] a, int[][] b) {
 		int n = a.length;
 		int m = b[0].length;
diff --git a/src/class098/Code05_DominoTromino.java b/src/class098/Code05_DominoTromino.java
@@ -62,6 +62,7 @@ public static int f2(int n) {
 		return (int) ans;
 	}
 
+	// 矩阵快速幂
 	public static int[][] power(int[][] m, int p) {
 		int n = m.length;
 		int[][] ans = new int[n][n];
@@ -77,6 +78,8 @@ public static int[][] power(int[][] m, int p) {
 		return ans;
 	}
 
+	// 矩阵相乘
+	// a的列数一定要等于b的行数
 	public static int[][] multiply(int[][] a, int[][] b) {
 		int n = a.length;
 		int m = b[0].length;
diff --git a/src/class098/Code06_CountVowelsPermutation.java b/src/class098/Code06_CountVowelsPermutation.java
@@ -35,6 +35,7 @@ public static int countVowelPermutation(int n) {
 		return (int) ans;
 	}
 
+	// 矩阵快速幂
 	public static int[][] power(int[][] m, int p) {
 		int n = m.length;
 		int[][] ans = new int[n][n];
@@ -50,6 +51,8 @@ public static int[][] power(int[][] m, int p) {
 		return ans;
 	}
 
+	// 矩阵相乘
+	// a的列数一定要等于b的行数
 	public static int[][] multiply(int[][] a, int[][] b) {
 		int n = a.length;
 		int m = b[0].length;
diff --git a/src/class098/Code07_StudentAttendanceRecordII.java b/src/class098/Code07_StudentAttendanceRecordII.java
@@ -37,6 +37,7 @@ public static int checkRecord(int n) {
 		return (int) (sum % MOD);
 	}
 
+	// 矩阵快速幂
 	public static int[][] power(int[][] m, int p) {
 		int n = m.length;
 		int[][] ans = new int[n][n];
@@ -52,6 +53,8 @@ public static int[][] power(int[][] m, int p) {
 		return ans;
 	}
 
+	// 矩阵相乘
+	// a的列数一定要等于b的行数
 	public static int[][] multiply(int[][] a, int[][] b) {
 		int n = a.length;
 		int m = b[0].length;

Original file line number	Diff line number	Diff line change
`@@ -36,6 +36,7 @@ public static int fib2(int n) {`
`36`	`36`	`return m[0][0];`
`37`	`37`	`}`
`38`	`38`
	`39`	`+ // 矩阵快速幂`
`39`	`40`	`public static int[][] power(int[][] m, int p) {`
`40`	`41`	`int n = m.length;`
`41`	`42`	`int[][] ans = new int[n][n];`
`@@ -51,6 +52,8 @@ public static int[][] power(int[][] m, int p) {`
`51`	`52`	`return ans;`
`52`	`53`	`}`
`53`	`54`
	`55`	`+ // 矩阵相乘`
	`56`	`+ // a的列数一定要等于b的行数`
`54`	`57`	`public static int[][] multiply(int[][] a, int[][] b) {`
`55`	`58`	`int n = a.length;`
`56`	`59`	`int m = b[0].length;`
Original file line number	Diff line number	Diff line change
`@@ -22,6 +22,7 @@ public static int climbStairs(int n) {`
`22`	`22`	`return m[0][0] + m[1][0];`
`23`	`23`	`}`
`24`	`24`
	`25`	`+ // 矩阵快速幂`
`25`	`26`	`public static int[][] power(int[][] m, int p) {`
`26`	`27`	`int n = m.length;`
`27`	`28`	`int[][] ans = new int[n][n];`
`@@ -37,6 +38,8 @@ public static int[][] power(int[][] m, int p) {`
`37`	`38`	`return ans;`
`38`	`39`	`}`
`39`	`40`
	`41`	`+ // 矩阵相乘`
	`42`	`+ // a的列数一定要等于b的行数`
`40`	`43`	`public static int[][] multiply(int[][] a, int[][] b) {`
`41`	`44`	`int n = a.length;`
`42`	`45`	`int m = b[0].length;`
Original file line number	Diff line number	Diff line change
`@@ -24,6 +24,7 @@ public static int tribonacci(int n) {`
`24`	`24`	`return m[0][0] + m[1][0];`
`25`	`25`	`}`
`26`	`26`
	`27`	`+ // 矩阵快速幂`
`27`	`28`	`public static int[][] power(int[][] m, int p) {`
`28`	`29`	`int n = m.length;`
`29`	`30`	`int[][] ans = new int[n][n];`
`@@ -39,6 +40,8 @@ public static int[][] power(int[][] m, int p) {`
`39`	`40`	`return ans;`
`40`	`41`	`}`
`41`	`42`
	`43`	`+ // 矩阵相乘`
	`44`	`+ // a的列数一定要等于b的行数`
`42`	`45`	`public static int[][] multiply(int[][] a, int[][] b) {`
`43`	`46`	`int n = a.length;`
`44`	`47`	`int m = b[0].length;`
Original file line number	Diff line number	Diff line change
`@@ -62,6 +62,7 @@ public static int f2(int n) {`
`62`	`62`	`return (int) ans;`
`63`	`63`	`}`
`64`	`64`
	`65`	`+ // 矩阵快速幂`
`65`	`66`	`public static int[][] power(int[][] m, int p) {`
`66`	`67`	`int n = m.length;`
`67`	`68`	`int[][] ans = new int[n][n];`
`@@ -77,6 +78,8 @@ public static int[][] power(int[][] m, int p) {`
`77`	`78`	`return ans;`
`78`	`79`	`}`
`79`	`80`
	`81`	`+ // 矩阵相乘`
	`82`	`+ // a的列数一定要等于b的行数`
`80`	`83`	`public static int[][] multiply(int[][] a, int[][] b) {`
`81`	`84`	`int n = a.length;`
`82`	`85`	`int m = b[0].length;`
Original file line number	Diff line number	Diff line change
`@@ -35,6 +35,7 @@ public static int countVowelPermutation(int n) {`
`35`	`35`	`return (int) ans;`
`36`	`36`	`}`
`37`	`37`
	`38`	`+ // 矩阵快速幂`
`38`	`39`	`public static int[][] power(int[][] m, int p) {`
`39`	`40`	`int n = m.length;`
`40`	`41`	`int[][] ans = new int[n][n];`
`@@ -50,6 +51,8 @@ public static int[][] power(int[][] m, int p) {`
`50`	`51`	`return ans;`
`51`	`52`	`}`
`52`	`53`
	`54`	`+ // 矩阵相乘`
	`55`	`+ // a的列数一定要等于b的行数`
`53`	`56`	`public static int[][] multiply(int[][] a, int[][] b) {`
`54`	`57`	`int n = a.length;`
`55`	`58`	`int m = b[0].length;`
Original file line number	Diff line number	Diff line change
`@@ -37,6 +37,7 @@ public static int checkRecord(int n) {`
`37`	`37`	`return (int) (sum % MOD);`
`38`	`38`	`}`
`39`	`39`
	`40`	`+ // 矩阵快速幂`
`40`	`41`	`public static int[][] power(int[][] m, int p) {`
`41`	`42`	`int n = m.length;`
`42`	`43`	`int[][] ans = new int[n][n];`
`@@ -52,6 +53,8 @@ public static int[][] power(int[][] m, int p) {`
`52`	`53`	`return ans;`
`53`	`54`	`}`
`54`	`55`
	`56`	`+ // 矩阵相乘`
	`57`	`+ // a的列数一定要等于b的行数`
`55`	`58`	`public static int[][] multiply(int[][] a, int[][] b) {`
`56`	`59`	`int n = a.length;`
`57`	`60`	`int m = b[0].length;`