feat(141): finish 141

Author: plh97

Helper/LinkList.go

@@ -31,3 +31,25 @@ func Ints2LinkList(ints []int) *ListNode {
 	}
 	return root
 }
+
+
+// Ints2ListWithCycle returns a list whose tail point to pos-indexed node
+// head's index is 0
+// if pos = -1, no cycle
+func Ints2ListWithCycle(nums []int, pos int) *ListNode {
+	head := Ints2LinkList(nums)
+	if pos == -1 {
+		return head
+	}
+	c := head
+	for pos > 0 {
+		c = c.Next
+		pos--
+	}
+	tail := c
+	for tail.Next != nil {
+		tail = tail.Next
+	}
+	tail.Next = c
+	return head
+}

algorithm/141.LinkedListCycle/README.md

@@ -0,0 +1,26 @@
+# [485. Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)
+
+## 2019/06/05
+
+### 题目 💗[easy]
+
+Given a binary array, find the maximum number of consecutive 1s in this array.
+
+给定一个二进制数组,找到最大连续的数字
+
+Example 1:
+
+```bash
+Input: [1,1,0,1,1,1]
+Output: 3
+Explanation: The first two digits or the last three digits are consecutive 1s.
+The maximum number of consecutive 1s is 3.
+```
+
+Note:
+
+1. The input array will only contain 0 and 1.
+   做这个输入数组将会是只是 0/1
+
+2. The length of input array is a positive integer and will not exceed 10,000
+   这个数组长度是整数,正数,不会超过 10000

algorithm/141.LinkedListCycle/main.go

@@ -0,0 +1,30 @@
+package hasCycle
+
+import (
+	"www/leetcode/Helper"
+)
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+
+type ListNode = Helper.ListNode
+
+// 快慢指针
+func hasCycle(head *ListNode) bool {
+	fast, slow := head, head
+	for fast != nil && slow != nil && fast.Next != nil {
+		fast = fast.Next.Next
+		slow = slow.Next
+		if fast == slow {
+			return true
+		}
+	}
+	return false
+}
+
+// for

algorithm/141.LinkedListCycle/main_test.go

@@ -0,0 +1,25 @@
+package hasCycle
+
+import (
+	"testing"
+	"www/leetcode/Helper"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  *ListNode
+	ans bool
+}{
+	{
+		Helper.Ints2ListWithCycle([]int{3, 2, 0, -4}, 1),
+		true,
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, hasCycle(tc.N1), "输入:%v", tc)
+	}
+}