Add：增加数据结构代码

Author: ibarryyan

.idea/go-design-patterns.iml

@@ -0,0 +1,26 @@
+package array
+
+import "fmt"
+
+type Array struct {
+	Items  []int32
+	Length int32
+}
+
+func NewArray(length int32, items ...int32) *Array {
+	if int32(len(items)) > length {
+		return nil
+	}
+
+	newItems := make([]int32, length)
+	for i := range len(items) {
+		newItems[i] = items[i]
+	}
+	return &Array{Items: newItems, Length: length}
+}
+
+func (arr *Array) Print() {
+	for _, item := range arr.Items {
+		fmt.Printf("%d,", item)
+	}
+}

datastruct/01-array/README.md

@@ -0,0 +1,10 @@
+package array
+
+import "testing"
+
+func TestArray(t *testing.T) {
+
+	array := NewArray(10, 1, 2, 3)
+
+	array.Print()
+}

datastruct/01-array/array.go

@@ -0,0 +1,50 @@
+package linked_list
+
+import "fmt"
+
+type Node struct {
+	Val  int32
+	Next *Node
+}
+
+func NewNode(val int32, next *Node) *Node {
+	node := &Node{Val: val, Next: next}
+	return node
+}
+
+func (node *Node) InsertAfter(val int32) {
+	node.Next = &Node{Val: val}
+}
+
+func (node *Node) InsertBefore(val int32) {
+	before := &Node{Val: val, Next: node}
+	node = before
+}
+
+func (node *Node) Delete(n *Node) {
+	if n.Next != nil {
+		node.Next = n.Next
+		n = nil
+	} else {
+		node.Next = nil
+	}
+}
+
+func (node *Node) ReverseByIteration() {
+	temp := node
+	for temp != nil {
+
+	}
+
+	node = node.Next
+
+}
+
+func (node *Node) Print() {
+	fmt.Printf("%d -> ", node.Val)
+
+	if node.Next != nil {
+		node = node.Next
+		node.Print()
+	}
+}

datastruct/01-array/array_test.go

@@ -0,0 +1,8 @@
+package linked_list
+
+import "testing"
+
+func TestLinkedList(t *testing.T) {
+	linkedList := NewNode(1, NewNode(2, nil))
+	linkedList.Print()
+}

datastruct/02-linked-list/linked_list.go

@@ -0,0 +1 @@
+package stack

datastruct/02-linked-list/linked_list_test.go

@@ -0,0 +1 @@
+package _4_queue

datastruct/03-stack/stack.go

@@ -0,0 +1,3 @@
+module datastruct
+
+go 1.23.3