golang刷leetcode 经典（6） 实现跳表

MyHashMap hashMap = new MyHashMap();
hashMap.put(1, 1);          
hashMap.put(2, 2);         
hashMap.get(1);            // 返回 1
hashMap.get(3);            // 返回 -1 (未找到)
hashMap.put(2, 1);         // 更新已有的值
hashMap.get(2);            // 返回 1 
hashMap.remove(2);         // 删除键为2的数据
hashMap.get(2);            // 返回 -1 (未找到) 

type MyHashMap struct {
    data []*Node
    len int
}

type Node struct{
    key int
    value int
    next  *Node
}

/** Initialize your data structure here. */
func Constructor() MyHashMap {
    return MyHashMap{
        data:make([]*Node,10001),
        len:10001,
    }
}


/** value will always be non-negative. */
func (this *MyHashMap) Put(key int, value int)  {
    data:=this.data[key%this.len]
    if data==nil{
        this.data[key%this.len]=&Node{
           key:key,
           value:value,
        }
    }else{
            if data.key==key{
                data.value=value
                return
            }
        for data.next!=nil{
            data=data.next
            if data.key==key{
                data.value=value
                return
            }
        }
        data.next=&Node{
            key:key,
            value:value,
        }
    }
    //this.Print()
}


/** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
func (this *MyHashMap) Get(key int) int {
    data:=this.data[key%this.len]
    if data==nil{
        return -1
    }
    for data.next!=nil{
        if data.key==key{
            return data.value
        }
        data=data.next
    }
    if data.key==key {
         return data.value
    }
    return -1
}


/** Removes the mapping of the specified value key if this map contains a mapping for the key */
func (this *MyHashMap) Remove(key int)  {
    data:=this.data[key%this.len]
    if data==nil{
        return
    }
    if data.key==key{
        this.data[key%this.len]=data.next
        //this.Print()
        return
    }
    for data.next!=nil{
        if data.next.key!=key{
            data=data.next
        }else{
            data.next=data.next.next
        }
    } 
}

func (this *MyHashMap)Print(){
   fmt.Println("----",this.len,":")
   for i:=0;i<len(this.data);i++{
       d:=this.data[i]
       if d!=nil{
           fmt.Println(this.data[i].key)
           for d.next!=nil{
               d=d.next
                fmt.Println(d.key)
           }     
       }
   }
   fmt.Println(":------")
}
/**
 * Your MyHashMap object will be instantiated and called as such:
 * obj := Constructor();
 * obj.Put(key,value);
 * param_2 := obj.Get(key);
 * obj.Remove(key);
 */