整理: 整理数据结构文件夹

qieguo2016 · qieguo2016 · commit 4e7f0785a718 · 2019-12-14T14:38:31.000+08:00
Change-Id: Ica2344e1b96299c8b4f2cfb0ab6ce5d6ff0e2a18
diff --git a/go/base/array.go b/go/base/array.go
diff --git a/go/basic/cache/lfu.go b/go/basic/cache/lfu.go
@@ -1,4 +1,4 @@
-package base
+package cache
 
 // LFUCache 基于内存实现
 // 原理：map结构按照kv存储数据，双向链表保存节点使用频率
diff --git a/go/basic/cache/lfu_test.go b/go/basic/cache/lfu_test.go
@@ -1,4 +1,4 @@
-package base
+package cache
 
 import (
 	"encoding/json"
diff --git a/go/basic/cache/lru.go b/go/basic/cache/lru.go
@@ -1,4 +1,4 @@
-package base
+package cache
 
 // LruCache 基于内存实现、不带过期时间
 // 原理：map结构按照kv存储数据，双向链表保存数据新鲜度
diff --git a/go/basic/cache/lru_test.go b/go/basic/cache/lru_test.go
@@ -1,4 +1,4 @@
-package base
+package cache
 
 import (
 	"fmt"
diff --git a/go/basic/concurrency/concurrency.go b/go/basic/concurrency/concurrency.go
@@ -1,4 +1,4 @@
-package base
+package concurrency
 
 import (
 	"fmt"
diff --git a/go/basic/concurrency/concurrency_test.go b/go/basic/concurrency/concurrency_test.go
@@ -1,4 +1,4 @@
-package base
+package concurrency
 
 import (
 	"fmt"
diff --git a/go/basic/dp/dynamic_programming.go b/go/basic/dp/dynamic_programming.go
@@ -1,4 +1,4 @@
-package base
+package dp
 
 /**
  * 求最大和子串，求给定整数数组中和最大的连续子串，输出最大和
diff --git a/go/basic/heap/heap.go b/go/basic/heap/heap.go
@@ -1,4 +1,4 @@
-package base
+package heap
 
 import (
 	"sort"
diff --git a/go/basic/heap/heap_test.go b/go/basic/heap/heap_test.go
@@ -1,4 +1,4 @@
-package base
+package heap
 
 import (
 	"fmt"
diff --git a/go/basic/list/link_list.go b/go/basic/list/link_list.go
@@ -1,4 +1,4 @@
-package base
+package list
 
 type LinkListNode struct {
 	value int
diff --git a/go/basic/list/link_list_operate.go b/go/basic/list/link_list_operate.go
@@ -1,4 +1,4 @@
-package base
+package list
 
 import (
 	"container/heap"
diff --git a/go/basic/list/link_list_test.go b/go/basic/list/link_list_test.go
@@ -1,4 +1,4 @@
-package base
+package list
 
 import (
 	"fmt"
diff --git a/go/basic/queue.go b/go/basic/queue.go
diff --git a/go/basic/skiplist/skip_list.go b/go/basic/skiplist/skip_list.go
@@ -1,4 +1,4 @@
-package base
+package skiplist
 
 import (
 	"math/rand"
diff --git a/go/basic/skiplist/skip_list_test.go b/go/basic/skiplist/skip_list_test.go
@@ -1,4 +1,4 @@
-package base
+package skiplist
 
 import (
 	"encoding/json"
diff --git a/go/basic/sort/sort.go b/go/basic/sort/sort.go
@@ -1,4 +1,4 @@
-package base
+package sort
 
 // BubbleSort 冒泡排序
 // 冒泡排序，更贴切的形容应该是沉底排序，每一轮内循环就是最大数沉底了。
diff --git a/go/basic/sort/sort_test.go b/go/basic/sort/sort_test.go
@@ -1,4 +1,4 @@
-package base
+package sort
 
 import (
 	"fmt"
diff --git a/go/basic/stack.go b/go/basic/stack.go
diff --git a/go/basic/tree/tree.go b/go/basic/tree/tree.go
@@ -1,4 +1,4 @@
-package base
+package sort
 
 // BuildDictTree 字典树
 func BuildDictTree(arr []string) map[string]interface{} {
diff --git a/go/basic/tree/tree_test.go b/go/basic/tree/tree_test.go
@@ -1,4 +1,4 @@
-package base
+package sort
 
 import (
 	"encoding/json"
diff --git a/go/basic/util.go b/go/basic/util.go

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package cache`
`2`	`2`
`3`	`3`	`// LFUCache 基于内存实现`
`4`	`4`	`// 原理：map结构按照kv存储数据，双向链表保存节点使用频率`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package concurrency`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"fmt"`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package dp`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* 求最大和子串，求给定整数数组中和最大的连续子串，输出最大和`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package heap`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"sort"`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package list`
`2`	`2`
`3`	`3`	`type LinkListNode struct {`
`4`	`4`	`value int`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package skiplist`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"math/rand"`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package base`
	`1`	`+package sort`
`2`	`2`
`3`	`3`	`// BubbleSort 冒泡排序`
`4`	`4`	`// 冒泡排序，更贴切的形容应该是沉底排序，每一轮内循环就是最大数沉底了。`