problem0705

README

705. Design HashSet

题目

Design a HashSetwithout using any built-in hash table libraries.

To be specific, your design should include these functions:

• add(value):Insert a value into the HashSet.
• contains(value) : Return whether the value exists in the HashSet or not.
• remove(value): Remove a value inthe HashSet. If the value does not exist in the HashSet, do nothing.

Example:

MyHashSet hashSet = new MyHashSet();
hashSet.add(1);
hashSet.add(2);
hashSet.contains(1); // returns true
hashSet.contains(3); // returns false (not found)
hashSet.add(2);
hashSet.contains(2); // returns true
hashSet.remove(2);
hashSet.contains(2); // returns false (already removed)

Note:

• All values will be in the range of [0, 1000000].
• The number of operations will be in the range of[1, 10000].
• Please do not use the built-in HashSet library.

解题思路

见程序注释

Documentation

Index

• type MyHashSet
  • func Constructor() MyHashSet
  • func (s *MyHashSet) Add(key int)
  • func (s *MyHashSet) Contains(key int) bool
  • func (s *MyHashSet) Remove(key int)

Types

type MyHashSet

type MyHashSet struct {
	// contains filtered or unexported fields
}

MyHashSet object will be instantiated and called as such: obj := Constructor(); obj.Add(key); obj.Remove(key); param_3 := obj.Contains(key);

func Constructor

func Constructor() MyHashSet

Constructor initialize your data structure here. */

func (*MyHashSet) Add

func (s *MyHashSet) Add(key int)

Add 添加 key

func (*MyHashSet) Contains

func (s *MyHashSet) Contains(key int) bool

Contains returns true if this set contains the specified element */

func (*MyHashSet) Remove

func (s *MyHashSet) Remove(key int)

Remove 移除 key