u012967763的专栏

package mainimport "fmt"const MAX_NUM = 100type SeqList struct { list [MAX_NUM]int length int}func (s *SeqList)CreateSeqList(arr [5]int) { length := len(arr) for i := 0; i < length; i++ { s.list[i] = arr[i] s.length++ }}func (s *Se.

package mainimport "fmt"//定义二叉树的节点type Node struct { value int left *Node right *Node}//功能：打印节点的值//参数：nil//返回值：nilfunc (node *Node)Print() { fmt.Printf("%d ", node.value)}//功能：设置节点的...

package mainimport "fmt"//功能：冒泡排序，从小到大排序//入参：待排序数组//返回值：排序好的数组func BubbleSort(arr []int, length int)(sort[]int) { for i := 0;i < length;i++ { for j := 0;j < length - i - 1;j++ { if...

package mainimport "fmt"//节点type Node struct { next *Node data int}//链式栈type LinkStack struct { head *Node length int}//创建节点func CreateNode(value int) *Node{ return &Node{ nil...

package mainimport "fmt"type DNode struct { data int next *DNode prev *DNode}type DoubleLinkList struct { length int head *DNode tail *DNode}func CreateDNode(data int) *DNode{ return...

package mainimport "fmt"//节点结构体type Node struct { data int next *Node}//链表类type List struct { head *Node length int}//创建节点func CreateNode(data int) *Node{ return &Node{data, nil...

package mainimport "fmt"type Queue struct { element []int}//创建一个新队列func NewQueue()*Queue{ return &Queue{}}//判断队列是否为空func (s *Queue)IsEmpty()bool{ if len(s.element) == 0 { return ...

package mainimport "fmt"type Stack struct { element []int}//创建一个新栈func NewStack()*Stack{ return &Stack{}}//判断栈是否为空func (s *Stack)IsEmpty()bool{ if len(s.element) == 0 { return tr...

package mainimport ( "errors" "fmt")const MaxSize int = 100type SeqListClass struct { data []int length int}//为数组分配空间func NewSeqList() *SeqListClass{ if MaxSize == 0 { return nil }...

package mainimport ( "errors" "fmt")//定义数组结构体type Array struct{ data []int length int}//为数组分配空间func NewArray(capacity uint) *Array{ if capacity == 0 { return nil }else{ return &am...