插入逆序

diff --git a/ch01/reverse/insert.go b/ch01/reverse/insert.go
new file mode 100644 (file)
index 0000000..54afe83
--- /dev/null
+++ b/ch01/reverse/insert.go
@@ -0,0 +1,20 @@
+package reverse
+
+import "github.com/isdamir/gotype"
+
+func InsertReverse(node *gotype.LNode) {
+       if node == nil || node.Next == nil {
+               return
+       }
+       var cur, next *gotype.LNode
+       cur = node.Next.Next
+       //设置链表第一个结点为尾结点
+       node.Next.Next = nil
+       //把遍历到的结点插入到头结点的后面
+       for cur != nil {
+               next = cur.Next
+               cur.Next = node.Next
+               node.Next = cur
+               cur = next
+       }
+}

diff --git a/ch01/reverse/reverse_test.go b/ch01/reverse/reverse_test.go
index 59681d9..b78c897 100644 (file)
--- a/ch01/reverse/reverse_test.go
+++ b/ch01/reverse/reverse_test.go
@@ -23,3 +23,11 @@ func TestRecursiveReverse(t *testing.T) {
        RecursiveReverse(head)
        gotype.PrintNode("逆序后：", head)
 }
+func TestInsertReverse(t *testing.T) {
+       head := &gotype.LNode{}
+       t.Log("插入法逆序")
+       gotype.CreateNode(head, 8)
+       gotype.PrintNode("逆序前：", head)
+       InsertReverse(head)
+       gotype.PrintNode("逆序后：", head)
+}