Better_JH的博客

func twoSum(nums []int, target int) []int { container := map[int]int{} for i,v := range nums { tmp := target - v if v, ok := container[tmp]; ok { return []int{v, i} } conta...

//全排列func permute(nums []int) [][]int { ret := make([][]int,0) permute_(nums,0,&ret) return ret}func permute_(nums []int, begin int, ret *[][]int){ if begin >= len(nums){ ...

package mainimport ( "fmt" "container/heap")type heap_ []intfunc (h heap_)Len() int { return len(h)}func (h heap_)Less(i,j int) bool { return h[i]<h[j]}func (h heap_)Swap(i,j int) { h[...

package main import ( "fmt")type Node struct { Data int Next *Node}func NewNode(data int)*Node{ return &Node{Data:data,Next:nil}}type List struct{ Root *Node}func NewList()*List{ v...

//treepackage mainimport ( _"strings" "reflect" "fmt" "test/stackqueue")type Node struct { Data interface{} LChild *Node RChild *Node}func

package main import ( "container/heap" "fmt")type Item struct{ value string priority int idx int//item在heap中的索引}type queue []*Itemfunc (q queue) Len() int{ return len(q)}func (q queue) S...

package main import ( "fmt")type TrieNode struct { Child map[interface{}]*TrieNode IsEnd bool}func NewTrieNode()*TrieNode{ return &TrieNode{Child:make(map[interface{}]*TrieNode),IsEnd:fal...

//采用切片作为底层结构package main import ( "reflect" "fmt")type Queue struct { Values []interface{} Type reflect.Type}//初始化一个队列func NewQueue(valueType reflect.Type)*Queue{ return &a

//采用切片作为底层结构，也可以使用container/list包，更为简洁package main import ( "reflect" "fmt")type Stack struct { Values []interface{} Type reflect.Type}func NewStack(valueType r

//插入func Insert(arr []int) { for i := 1; i < len(arr); i++ { tmp := arr[i] end := i - 1 //找插入位置&搬移 for ; end >= 0; end-- { if tmp &am