219 finish

Author: aQua

Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii.go

@@ -1,6 +1,10 @@
 package Problem0219
 
 func containsNearbyDuplicate(nums []int, k int) bool {
+	if k <= 0 {
+		return false
+	}
+	
 	// 利用 m 记录 a[i]中的值，每次出现的(索引号+1)
 	m := make(map[int]int, len(nums))
 

Algorithms/0219.contains-duplicate-ii/contains-duplicate-ii_test.go

@@ -38,6 +38,16 @@ func Test_Problem0219(t *testing.T) {
 			},
 		},
 
+		question{
+			para{
+				[]int{1, 2, 3, 4, 5},
+				0,
+			},
+			ans{
+				false,
+			},
+		},
+
 		question{
 			para{
 				[]int{1, 2, 3, 4, 5},