feat: add golang solution for lcof problem 17 18

Author: hzliangbin

lcof/面试题17. 打印从1到最大的n位数/README.md

@@ -52,7 +52,26 @@ var printNumbers = function(n) {
 };
 ```
 
+### Go
+
+```go
+func printNumbers(n int) []int {
+    d := 10
+    for i :=1; i < n ; i++ {
+        d *= 10
+    }
+    res := make([]int,d-1)
+    for i:=1;i < d; i ++ {
+        res[i-1] = i
+    }
+    return res
+}
+```
+
+
+
 ### ...
+
 ```
 
 ```

lcof/面试题17. 打印从1到最大的n位数/Solution.go

@@ -0,0 +1,11 @@
+func printNumbers(n int) []int {
+    d := 10
+    for i :=1; i < n ; i++ {
+        d *= 10
+    }
+    res := make([]int,d-1)
+    for i:=1;i < d; i ++ {
+        res[i-1] = i
+    }
+    return res
+}

lcof/面试题18. 删除链表的节点/README.md

@@ -114,7 +114,32 @@ var deleteNode = function(head, val) {
 };
 ```
 
+### Go
+
+```go
+func deleteNode(head *ListNode, val int) *ListNode {
+    res := &ListNode{
+        Val: 0,
+        Next: head,
+    }
+    pre := res
+    cur := res.Next
+    for cur != nil {
+        if cur.Val == val {
+            pre.Next = cur.Next
+            return res.Next
+        }
+        cur = cur.Next
+        pre = pre.Next
+    }
+    return res.Next
+}
+```
+
+
+
 ### ...
+
 ```
 
 ```

lcof/面试题18. 删除链表的节点/Solution.go

@@ -0,0 +1,17 @@
+func deleteNode(head *ListNode, val int) *ListNode {
+    res := &ListNode{
+        Val: 0,
+        Next: head,
+    }
+    pre := res
+    cur := res.Next
+    for cur != nil {
+        if cur.Val == val {
+            pre.Next = cur.Next
+            return res.Next
+        }
+        cur = cur.Next
+        pre = pre.Next
+    }
+    return res.Next
+}