hbk5241的博客

package mainimport ( "fmt" "strconv" "strings")type Node struct { data interface{} next *Node}type LinkedStack struct { length int head *Node}func NewLinkedStack() LinkedStack { return LinkedStack{length: 0, head: nil}}func (s *Linke

package mainimport "fmt"// FibonacciFor 循环func FibonacciFor(num int) []int { a := 0 b := 1 l := make([]int, 0) for i := 0; i < num; i++ { l = append(l, a) tmp := a a = b b = tmp + a } return l}// FibonacciRecursive 递归func fibonacc

package mainimport "fmt"type Node struct { data interface{} next *Node}type LinkedStack struct { length int head *Node}func NewLinkedStack() LinkedStack { return LinkedStack{length: 0, head: nil}}func (s *LinkedStack) Clear() { s.length

package mainimport "fmt"type ListStack struct { top int stack []interface{} length int maxSize int}func NewListStack(maxSize int) ListStack { return ListStack{ top: -1, stack: make([]interface{}, maxSize), length: 0, maxSi

package mainimport ( "fmt" "strconv")type Node struct { data interface{} pre *Node next *Node}type DoubleLinkedList struct { length int head *Node tail *Node}func NewDoubleLinkedList() DoubleLinkedList { node := Node{} l := Double

package mainimport ( "fmt" "strconv")type Node struct { data interface{} next *Node}type CycleLinkedList struct { length int rear *Node}func NewCycleLinkedList() CycleLinkedList { node := Node{} l := CycleLinkedList{ length: 0, rea

package mainimport ( "fmt" "strconv")type Node struct { data interface{} next *Node}type LinkedList struct { length int head *Node tail *Node}func NewLinkedList() LinkedList { node := Node{} l := LinkedList{ length: 0, head: &

package mainimport "fmt"type List struct { length int Data []interface{} maxSize int}func (l *List) ListInit(size int) { l.maxSize = size l.length = 0 l.Data = make([]interface{}, size)}// Length 顺序表的长度func (l *List) Length() int { re