algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #226 from kinsolee/master

Browse Source 
fix 706:  bug with edge case
This commit is contained in:
halfrost
2022-03-01 20:56:27 -08:00
committed by GitHub
parent a3977996e9 09d51fd394
commit bc7f1d1120
3 changed files with 8 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/0706.Design-HashMap/706. Design HashMap.go
View File

@ -1,6 +1,6 @@
package leetcode
const Len int = 100000
const Len int = 10000
type MyHashMap struct {
content [Len]*HashNode
@ -41,9 +41,9 @@ func (N *HashNode) Remove(key int) *HashNode {
return p
}
if N.next != nil {
return N.next.Remove(key)
N.next = N.next.Remove(key)
}
return nil
return N
}
/** Initialize your data structure here. */

3
leetcode/0706.Design-HashMap/706. Design HashMap_test.go
View File

@ -13,6 +13,9 @@ func Test_Problem706(t *testing.T) {
fmt.Printf("Contains 7 = %v\n", obj.Get(7))
param1 := obj.Get(100)
fmt.Printf("param1 = %v\n", param1)
obj.Remove(100007)
param1 = obj.Get(7)
fmt.Printf("param1 = %v\n", param1)
obj.Remove(7)
param1 = obj.Get(7)
fmt.Printf("param1 = %v\n", param1)

4
website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
View File

@ -98,9 +98,9 @@ func (N *HashNode) Remove(key int) *HashNode {
return p
}
if N.next != nil {
return N.next.Remove(key)
N.next = N.next.Remove(key)
}
return nil
return N
}
/** Initialize your data structure here. */