code-forked
diff --git a/‎02-数据结构/02-栈3-链栈.md‎
Lines changed: 38 additions & 0 deletions b/‎02-数据结构/02-栈3-链栈.md‎
Lines changed: 38 additions & 0 deletions
diff --git a/‎02-数据结构/02-栈4-总结.md‎
Lines changed: 0 additions & 72 deletions b/‎02-数据结构/02-栈4-总结.md‎
Lines changed: 0 additions & 72 deletions
diff --git a/‎images/Algorithm/stack-2.png‎
-26.2 KB b/‎images/Algorithm/stack-2.png‎
-26.2 KB
diff --git a/‎images/Algorithm/stack-3.png‎
-125 KB b/‎images/Algorithm/stack-3.png‎
-125 KB
diff --git a/‎images/Algorithm/stack-4.png‎
-188 KB b/‎images/Algorithm/stack-4.png‎
-188 KB
@@ -9,4 +9,42 @@
 ## 二 链栈的Go实现
 ```go
 
+type Node struct {
+	data interface{}
+	next *Node
+}
+
+type LinkedStack struct {
+	Top    *Node // 栈顶元素
+	Length int
+}
+
+func New() *LinkedStack {
+	return &LinkedStack{
+		nil,
+		0,
+	}
+}
+
+// 压栈
+func (ls *LinkedStack) Push(data interface{}) {
+	node := new(Node)
+	node.data = data
+	node.next = ls.Top
+	ls.Top = node
+	ls.Length++
+}
+
+// 出栈
+func (ls *LinkedStack) Pop() interface{} {
+	if ls.Length == 0 {
+		fmt.Println("stack is empty")
+		return nil
+	}
+	value := ls.Top.data
+	node := ls.Top
+	ls.Top = node.next
+	ls.Length--
+	return value
+}
 ```