feat: update golang solution to lcci problems: No. 01.09~02.02

Author: maolonglong

lcci/01.09.String Rotation/README.md

@@ -60,6 +60,14 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func isFlipedString(s1 string, s2 string) bool {
+	return len(s1) == len(s2) && strings.Contains(s1+s1, s2)
+}
+```
+
 ### **...**
 
 ```

lcci/01.09.String Rotation/README_EN.md

@@ -56,6 +56,14 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func isFlipedString(s1 string, s2 string) bool {
+	return len(s1) == len(s2) && strings.Contains(s1+s1, s2)
+}
+```
+
 ### **...**
 
 ```

lcci/01.09.String Rotation/Solution.go

@@ -0,0 +1,3 @@
+func isFlipedString(s1 string, s2 string) bool {
+	return len(s1) == len(s2) && strings.Contains(s1+s1, s2)
+}

lcci/02.01.Remove Duplicate Node/README.md

@@ -164,6 +164,27 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func removeDuplicateNodes(head *ListNode) *ListNode {
+	if head == nil {
+		return nil
+	}
+	vis := map[int]bool{head.Val: true}
+	p := head
+	for p.Next != nil {
+		if vis[p.Next.Val] {
+			p.Next = p.Next.Next
+		} else {
+			vis[p.Next.Val] = true
+			p = p.Next
+		}
+	}
+	return head
+}
+```
+
 ### **...**
 
 ```

lcci/02.01.Remove Duplicate Node/README_EN.md

@@ -164,6 +164,27 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func removeDuplicateNodes(head *ListNode) *ListNode {
+	if head == nil {
+		return nil
+	}
+	vis := map[int]bool{head.Val: true}
+	p := head
+	for p.Next != nil {
+		if vis[p.Next.Val] {
+			p.Next = p.Next.Next
+		} else {
+			vis[p.Next.Val] = true
+			p = p.Next
+		}
+	}
+	return head
+}
+```
+
 ### **...**
 
 ```

lcci/02.01.Remove Duplicate Node/Solution.go

@@ -0,0 +1,16 @@
+func removeDuplicateNodes(head *ListNode) *ListNode {
+	if head == nil {
+		return nil
+	}
+	vis := map[int]bool{head.Val: true}
+	p := head
+	for p.Next != nil {
+		if vis[p.Next.Val] {
+			p.Next = p.Next.Next
+		} else {
+			vis[p.Next.Val] = true
+			p = p.Next
+		}
+	}
+	return head
+}

lcci/02.02.Kth Node From End of List/README.md

@@ -133,6 +133,22 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func kthToLast(head *ListNode, k int) int {
+	slow, fast := head, head
+	for i := 0; i < k; i++ {
+		fast = fast.Next
+	}
+	for fast != nil {
+		slow = slow.Next
+		fast = fast.Next
+	}
+	return slow.Val
+}
+```
+
 ### **...**
 
 ```

lcci/02.02.Kth Node From End of List/README_EN.md

@@ -125,6 +125,22 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func kthToLast(head *ListNode, k int) int {
+	slow, fast := head, head
+	for i := 0; i < k; i++ {
+		fast = fast.Next
+	}
+	for fast != nil {
+		slow = slow.Next
+		fast = fast.Next
+	}
+	return slow.Val
+}
+```
+
 ### **...**
 
 ```

lcci/02.02.Kth Node From End of List/Solution.go

@@ -0,0 +1,11 @@
+func kthToLast(head *ListNode, k int) int {
+	slow, fast := head, head
+	for i := 0; i < k; i++ {
+		fast = fast.Next
+	}
+	for fast != nil {
+		slow = slow.Next
+		fast = fast.Next
+	}
+	return slow.Val
+}