reformat import order

Author: donng

03-Stacks-and-Queues/04-More-about-Leetcode/Solution/Solution.go 03-Stacks-and-Queues/04-More-about-Leetcode/solution/Solution.go

@@ -50,7 +50,7 @@ func (a *Array) IsEmpty() bool {
 // 在第 index 个位置插入一个新元素 e
 func (a *Array) Add(index int, e interface{}) {
 	if index < 0 || index > a.size {
-		panic("Add failed. Require index >= 0 and index <= size.")
+		panic("add failed, index is out of range")
 	}
 
 	if a.size == len(a.data) {
@@ -78,7 +78,7 @@ func (a *Array) AddFirst(e interface{}) {
 // 获取 index 索引位置的元素
 func (a *Array) Get(index int) interface{} {
 	if index < 0 || index >= a.size {
-		panic("Get failed. Index is illegal.")
+		panic("get failed, index is out of range")
 	}
 	return a.data[index]
 }
@@ -94,7 +94,7 @@ func (a *Array) GetFirst() interface{} {
 // 修改 index 索引位置的元素
 func (a *Array) Set(index int, e interface{}) {
 	if index < 0 || index >= a.size {
-		panic("Set failed. Index is illegal.")
+		panic("set failed, index is out of range")
 	}
 	a.data[index] = e
 }
@@ -132,7 +132,7 @@ func (a *Array) FindAll(e interface{}) (indexes []int) {
 // 从数组中删除 index 位置的元素，返回删除的元素
 func (a *Array) Remove(index int) interface{} {
 	if index < 0 || index >= a.size {
-		panic("Remove failed,Index is illegal.")
+		panic("remove failed, index is out range")
 	}
 
 	e := a.data[index]

03-Stacks-and-Queues/04-More-about-Leetcode/Solution/solution_test.go 03-Stacks-and-Queues/04-More-about-Leetcode/solution/solution_test.go

@@ -12,7 +12,7 @@ type LoopQueue struct {
 	tail  int
 }
 
-func Constructor(capacity int) *LoopQueue {
+func New(capacity int) *LoopQueue {
 	return &LoopQueue{
 		data: make([]interface{}, capacity+1),
 	}
@@ -106,7 +106,7 @@ func (lq *LoopQueue) String() string {
 }
 
 func main() {
-	queue := Constructor(10)
+	queue := New(10)
 	for i := 0; i < 10; i++ {
 		queue.Enqueue(i)
 		fmt.Println(queue)

03-Stacks-and-Queues/05-Array-Queue/solution/solution.go

@@ -2,13 +2,14 @@ package main
 
 import (
 	"fmt"
+	"path/filepath"
+	"time"
+
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/06-Resizing-in-Hash-Table/AVLTree"
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/06-Resizing-in-Hash-Table/BSTMap"
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/06-Resizing-in-Hash-Table/RBTree"
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/06-Resizing-in-Hash-Table/hashtable"
 	"github.com/donng/Play-with-Data-Structures/utils"
-	"path/filepath"
-	"time"
 )
 
 func main() {

03-Stacks-and-Queues/Optional-02-Loop-Queue-without-Size-Member/loopqueue/LoopQueue.go 03-Stacks-and-Queues/Optional-02-Loop-Queue-without-Size-Member/loopqueue/loopqueue.go

@@ -2,13 +2,14 @@ package main
 
 import (
 	"fmt"
+	"path/filepath"
+	"time"
+
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/07-More-About-Resizing-in-Hash-Table/AVLTree"
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/07-More-About-Resizing-in-Hash-Table/BSTMap"
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/07-More-About-Resizing-in-Hash-Table/HashTable"
 	"github.com/donng/Play-with-Data-Structures/14-Hash-Table/07-More-About-Resizing-in-Hash-Table/RBTree"
 	"github.com/donng/Play-with-Data-Structures/utils"
-	"path/filepath"
-	"time"
 )
 
 func main() {