Merge pull request #183 from lightfish-zhang/master

 add Solution 0026, 0075, 0141 [golang]

Author: yanglbme

solution/0026.Remove Duplicates from Sorted Array/Solution.go

@@ -0,0 +1,21 @@
+/**
+ * @lc app=leetcode.cn id=26 lang=golang
+ * Accepted
+ * 161/161 cases passed (144 ms)
+ * Your runtime beats 36.91 % of golang submissions
+ * Your memory usage beats 40.4 % of golang submissions (8.2 MB)
+ */
+
+func removeDuplicates(nums []int) int {
+	if nums == nil || len(nums) == 0 {
+		return 0
+	}
+	j := 0
+	for i := 1; i < len(nums); i++ {
+		if nums[j] != nums[i] {
+			j++
+			nums[j] = nums[i]
+		}
+	}
+	return j + 1
+}

solution/0075.Sort Colors/Solution.go

@@ -0,0 +1,20 @@
+/*
+ * @lc app=leetcode.cn id=75 lang=golang
+ *  87/87 cases passed (4 ms)， memory usage 2.4 MB
+ */
+func sortColors(nums []int) {
+	finish0 := -1       // 元素1结束的位置
+	start2 := len(nums) // 元素2开始的位置
+	for i := 0; i < start2; {
+		if nums[i] == 0 {
+			finish0++
+			nums[i], nums[finish0] = nums[finish0], 0
+			i++
+		} else if nums[i] == 2 {
+			start2--
+			nums[i], nums[start2] = nums[start2], 2
+		} else {
+			i++
+		}
+	}
+}

solution/0141.Linked List Cycle/Solution.go

@@ -0,0 +1,20 @@
+/*
+ * @lc app=leetcode.cn id=141 lang=golang
+ *  17/17 cases passed (12 ms)， memory usage 4 MB
+ */
+func hasCycle(head *ListNode) bool {
+	if head == nil || head.Next == nil {
+		return false
+	}
+	slow, fast := head, head.Next
+	for {
+		if fast == nil || fast.Next == nil {
+			return false
+		}
+		if slow == fast {
+			return true
+		}
+		slow, fast = slow.Next, fast.Next.Next
+	}
+	return false
+}