Update Leetcode 题解.md

itwzh · web-flow · commit 95d516c7d556 · 2019-02-22T16:49:16.000+08:00
独数题解中的调用回溯应该是backtracking(0, 0);  不是backtracking(i, 0);
diff --git a/docs/notes/Leetcode 题解.md b/docs/notes/Leetcode 题解.md
@@ -2316,7 +2316,7 @@ public void solveSudoku(char[][] board) {
             colsUsed[j][num] = true;
             cubesUsed[cubeNum(i, j)][num] = true;
         }
-        backtracking(i, 0);
+        backtracking(0, 0);
 }
 
 private boolean backtracking(int row, int col) {

Original file line number	Diff line number	Diff line change
`@@ -2316,7 +2316,7 @@ public void solveSudoku(char[][] board) {`
`2316`	`2316`	`colsUsed[j][num] = true;`
`2317`	`2317`	`cubesUsed[cubeNum(i, j)][num] = true;`
`2318`	`2318`	`}`
`2319`		`- backtracking(i, 0);`
	`2319`	`+ backtracking(0, 0);`
`2320`	`2320`	`}`
`2321`	`2321`
`2322`	`2322`	`private boolean backtracking(int row, int col) {`