refactor: datastruct (#81)

Signed-off-by: ashing <axingfly@gmail.com>

.github/workflows/codecov.yml

@@ -28,7 +28,7 @@ jobs:
         run: go mod tidy
 
       - name: run codecov.sh
-        run: bash script/codecov.sh
+        run: bash scripts/codecov.sh
 
       - name: Publish to codecov.io
-        run: bash <(curl -s https://codecov.io/bash)
+        run: bash <(curl -s https://codecov.io/bash)

.github/workflows/go-lint.yml

@@ -41,4 +41,18 @@ jobs:
               echo "Files are not formatted by gofmt:"
               echo $diffs
               exit 1
-          fi
+          fi
+  sort-import-lint:
+    runs-on: ubuntu-latest
+    timeout-minutes: 10
+    steps:
+      - uses: actions/checkout@v3
+      - name: Setup Go Environment
+        uses: actions/setup-go@v3
+        with:
+          go-version: "1.21.3"
+      - name: Sort Import Lint
+        run: make sort-import
+      - name: Check for changes
+        run: |
+          git diff --exit-code || { echo "Go imports revisions detected. Please run make sort-import and commit changes."; exit 1; }

.github/workflows/semantic.yml

@@ -28,4 +28,4 @@ jobs:
             ci
             chore
             revert
-            change
+            change

Makefile

@@ -0,0 +1,3 @@
+.PHONY: sort-import
+sort-import:
+	@./scripts/goimports-reviser.sh

jianzhioffer/03/main_test.go

@@ -1,8 +1,9 @@
 package main
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 func TestFindRepeatNumber(t *testing.T) {

jianzhioffer/04/04_test.go

@@ -1,8 +1,9 @@
 package _4
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 func TestFindNumberIn2DArray(t *testing.T) {

jianzhioffer/05/main_test.go

@@ -1,8 +1,9 @@
 package main
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 func TestReplaceSpace(t *testing.T) {

jianzhioffer/06/main.go

@@ -1,10 +1,10 @@
 package main
 
 import (
-	"algorithm/guns"
+	"algorithm/template"
 )
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 func reversePrint(head *ListNode) []int {
 	res := make([]int, 0)

jianzhioffer/06/main_test.go

@@ -1,8 +1,9 @@
 package main
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 func TestReversePrint(t *testing.T) {

jianzhioffer/07/main.go

@@ -1,8 +1,10 @@
 package main
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type TreeNode = guns.TreeNode
+type TreeNode = template.TreeNode
 
 type tree struct {
 	preorder   []int

jianzhioffer/09/main_test.go

@@ -1,8 +1,9 @@
 package main
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 func TestCQueue_AppendTail(t *testing.T) {

jianzhioffer/11/main_test.go

@@ -1,8 +1,9 @@
 package main
 
 import (
-	"github.com/stretchr/testify/assert"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 func TestMinArray(t *testing.T) {

jianzhioffer/12/main_test.go

@@ -1,8 +1,9 @@
 package main
 
 import (
-	"github.com/bmizerany/assert"
 	"testing"
+
+	"github.com/bmizerany/assert"
 )
 
 func TestExist(t *testing.T) {

lcp/44/LCP 44. 开幕式焰火.go

@@ -1,8 +1,10 @@
 package _4
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type TreeNode = guns.TreeNode
+type TreeNode = template.TreeNode
 
 func numColor(root *TreeNode) int {
 	// 遍历之后进行去重

leetcode/0022/0022.go

@@ -4,7 +4,7 @@ import (
 	"strings"
 )
 
-//https://leetcode-cn.com/problems/generate-parentheses/solution/gua-hao-sheng-cheng-by-leetcode-solution/
+// https://leetcode-cn.com/problems/generate-parentheses/solution/gua-hao-sheng-cheng-by-leetcode-solution/
 func generateParenthesis(n int) []string {
 	ans := make([]string, 0)
 	backTrack([]string{}, 0, 0, &ans, n)

leetcode/0053/0059.go

@@ -1,9 +1,9 @@
 package main
 
-//输入: [-2,1,-3,4,-1,2,1,-5,4]
-//输出: 6
-//maxSubArray
-//https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-by-leetcode-solution/
+// 输入: [-2,1,-3,4,-1,2,1,-5,4]
+// 输出: 6
+// maxSubArray
+// https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-by-leetcode-solution/
 func maxSubArray(nums []int) int {
 	max := nums[0]
 	for i := 1; i < len(nums); i++ {

leetcode/0101/0101_test.go

@@ -6,9 +6,9 @@ import (
 	"github.com/stretchr/testify/assert"
 )
 
-//[1,2,2,3,4,4,3]
-//[1,2,2,null,3,null,3]
-//[]
+// [1,2,2,3,4,4,3]
+// [1,2,2,null,3,null,3]
+// []
 func TestIsSymmetric(t *testing.T) {
 	t.Run("nil", func(t *testing.T) {
 		r := isSymmetric(nil)
@@ -50,7 +50,7 @@ func TestIsSymmetric(t *testing.T) {
 	})
 }
 
-//TODO:构建树
+// TODO:构建树
 func BuildTree(nums []int) *TreeNode {
 	return nil
 }

leetcode/0104/104. Maximum Depth of Binary Tree.go

@@ -1,8 +1,10 @@
 package _104
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type TreeNode = guns.TreeNode
+type TreeNode = template.TreeNode
 
 func maxDepth(root *TreeNode) int {
 	return subMaxDepth(root)

leetcode/0129/129. Sum Root to Leaf Numbers.go

@@ -1,8 +1,10 @@
 package _129
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type TreeNode = guns.TreeNode
+type TreeNode = template.TreeNode
 
 func dfs(root *TreeNode, prevSum int) int {
 	if root == nil {

leetcode/0143/143. Reorder List.go

@@ -1,8 +1,10 @@
 package _143
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 func reorderList(head *ListNode) {
 	//边界判定

leetcode/0144/144. Binary Tree Preorder Traversal.go

@@ -1,8 +1,10 @@
 package _144
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type TreeNode = guns.TreeNode
+type TreeNode = template.TreeNode
 
 func preorderTraversal(root *TreeNode) []int {
 	return sub(root)

leetcode/0206/go/main.go

@@ -1,7 +1,7 @@
 package main
 
 import (
-	"algorithm/guns"
+	"algorithm/template"
 )
 
 /**
@@ -12,7 +12,7 @@ import (
  * }
  */
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 func reverseList(head *ListNode) *ListNode {
 	if head == nil || head.Next == nil {

leetcode/0226/0226.go

@@ -1,6 +1,6 @@
 package main
 
-//TreeNode 二叉树节点
+// TreeNode 二叉树节点
 type TreeNode struct {
 	Val   int
 	Left  *TreeNode

leetcode/0234/234. Palindrome Linked List.go

@@ -1,8 +1,10 @@
 package _234
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 func isPalindrome(head *ListNode) bool {
 	//使用数组存储

leetcode/0234/234. Palindrome Linked List_test.go

@@ -3,19 +3,20 @@ package _234
 import (
 	"testing"
 
-	"algorithm/guns"
 	"github.com/bmizerany/assert"
+
+	"algorithm/template"
 )
 
 func Test_isPalindrome(t *testing.T) {
 	assert.Equal(
 		t,
 		false,
-		isPalindrome(guns.GenLinkList([]int{1, 2})),
+		isPalindrome(template.GenLinkList([]int{1, 2})),
 	)
 	assert.Equal(
 		t,
 		true,
-		isPalindrome(guns.GenLinkList([]int{1, 2, 2, 1})),
+		isPalindrome(template.GenLinkList([]int{1, 2, 2, 1})),
 	)
 }

leetcode/0404/0404.go

@@ -1,8 +1,10 @@
 package main
 
-import "algorithm/guns"
+import (
+	"algorithm/template"
+)
 
-type TreeNode = guns.TreeNode // 修改签名，下面的 TreeNode 就不需要变
+type TreeNode = template.TreeNode // 修改签名，下面的 TreeNode 就不需要变
 
 func sumOfLeftLeaves(root *TreeNode) int {
 	//return subSumOfLeftLeaves(root, false, 0)

leetcode/0925/925. Long Pressed Name.go

@@ -28,7 +28,7 @@ func isLongPressedName(name string, typed string) bool {
 	return false
 }
 
-//双指针
+// 双指针
 func isLongPressedNamePlanB(name string, typed string) bool {
 	i, j := 0, 0
 	for j < len(typed) {

leetcode/148. Sort List.go

@@ -1,8 +1,9 @@
 package leetcode
 
 import (
-	"algorithm/topic/linkedlist"
 	"sort"
+
+	"algorithm/topic/linkedlist"
 )
 
 type ListNode = linkedlist.ListNode

leetcode/1927/1927. Sum Game.go

@@ -2,7 +2,7 @@ package _1927
 
 import "log"
 
-//参考题解: https://leetcode-cn.com/problems/sum-game/solution/shu-xue-jie-fa-by-newhar-fqjs/
+// 参考题解: https://leetcode-cn.com/problems/sum-game/solution/shu-xue-jie-fa-by-newhar-fqjs/
 func sumGame(num string) bool {
 	sum1 := 0
 	cnt1 := 0

leetcode_91_2/2020/0023/23. Merge k Sorted Lists.go

@@ -3,10 +3,10 @@ package _023
 import (
 	"sort"
 
-	"algorithm/guns"
+	"algorithm/template"
 )
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 type Queue struct {
 	element []*ListNode

leetcode_91_2/2020/0024/24. Swap Nodes in Pairs.go

@@ -3,10 +3,10 @@ package _024
 import (
 	"fmt"
 
-	"algorithm/guns"
+	"algorithm/template"
 )
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 // var swapPairs = swapPairs1
 func swapPairs1(head *ListNode) *ListNode {

leetcode_91_2/2020/0061/0061_2/61. Rotate List.go

@@ -3,10 +3,10 @@ package _061
 import (
 	"fmt"
 
-	"algorithm/guns"
+	"algorithm/template"
 )
 
-type ListNode = guns.ListNode
+type ListNode = template.ListNode
 
 func rotateRight(head *ListNode, k int) *ListNode {
 	if head == nil || head.Next == nil {