Commit 0cb66f4

author

Shuo

authored

Merge pull request #236 from openset/develop

Add: Contains Duplicate II

2 parents b8b62c5 + 61c4a4b commit 0cb66f4Copy full SHA for 0cb66f4

File tree

+45

-0

lines changed

+45

-0

lines changed

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,12 @@`
`1`	`1`	`package contains_duplicate_ii`
	`2`	`+`
	`3`	`+func containsNearbyDuplicate(nums []int, k int) bool {`
	`4`	`+ m := make(map[int]int, len(nums))`
	`5`	`+ for i, v := range nums {`
	`6`	`+ if p, ok := m[v]; ok && i-p <= k {`
	`7`	`+ return true`
	`8`	`+ }`
	`9`	`+ m[v] = i`
	`10`	`+ }`
	`11`	`+ return false`
	`12`	`+}`

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,35 @@`
`1`	`1`	`package contains_duplicate_ii`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+type caseType struct {`
	`6`	`+ nums []int`
	`7`	`+ k int`
	`8`	`+ expected bool`
	`9`	`+}`
	`10`	`+`
	`11`	`+func TestContainsNearbyDuplicate(t *testing.T) {`
	`12`	`+ tests := [...]caseType{`
	`13`	`+ {`
	`14`	`+ nums: []int{1, 2, 3, 1},`
	`15`	`+ k: 3,`
	`16`	`+ expected: true,`
	`17`	`+ },`
	`18`	`+ {`
	`19`	`+ nums: []int{1, 0, 1, 1},`
	`20`	`+ k: 1,`
	`21`	`+ expected: true,`
	`22`	`+ },`
	`23`	`+ {`
	`24`	`+ nums: []int{1, 2, 3, 1, 2, 3},`
	`25`	`+ k: 2,`
	`26`	`+ expected: false,`
	`27`	`+ },`
	`28`	`+ }`
	`29`	`+ for _, tc := range tests {`
	`30`	`+ output := containsNearbyDuplicate(tc.nums, tc.k)`
	`31`	`+ if output != tc.expected {`
	`32`	`+ t.Fatalf("input: %v %v, output: %v, expected: %v", tc.nums, tc.k, output, tc.expected)`
	`33`	`+ }`
	`34`	`+ }`
	`35`	`+}`

Comments

(0)