63 finish

Author: aQua

Algorithms/0063.unique-paths-ii/README.md

@@ -20,5 +20,5 @@ The total number of unique paths is `2`.
 **Note:** m and n will be at most 100.
 
 ## 解题思路
-
+和[62. Unique Paths](../0062.unique-paths)的解题思路一样。
 见程序注释

Algorithms/0063.unique-paths-ii/unique-paths-ii.go

@@ -7,7 +7,10 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int {
 	}
 
 	n := len(obstacleGrid[0])
-
+	if n == 0 {
+		return 0
+	}
+	
 	dp := make([][]int, m)
 	for i := range dp {
 		dp[i] = make([]int, n)

Algorithms/0063.unique-paths-ii/unique-paths-ii_test.go

@@ -70,6 +70,17 @@ func Test_Problem0063(t *testing.T) {
 			},
 			ans{0},
 		},
+
+		question{
+			para{
+				[][]int{
+					[]int{},
+					[]int{},
+				},
+			},
+			ans{0},
+		},
+
 		// 如需多个测试，可以复制上方元素。
 	}