160 added

Author: aQuaYi

Algorithms/0160.intersection-of-two-linked-lists/1.png

@@ -0,0 +1,47 @@
+# [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)
+
+Write a program to find the node at which the intersection of two singly linked lists begins.
+
+For example, the following two linked lists:
+
+![p](p.png)
+
+begin to intersect at node c1.
+
+Example 1:
+
+![1](1.png)
+
+```text
+Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
+Output: Reference of the node with value = 8
+Input Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.
+```
+
+Example 2:
+
+![2](2.png)
+
+```text
+Input: intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
+Output: Reference of the node with value = 2
+Input Explanation: The intersected node's value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.
+```
+
+Example 3:
+
+![3](3.png)
+
+```text
+Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
+Output: null
+Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values.
+Explanation: The two lists do not intersect, so return null.
+```
+
+Notes:
+
+- If the two linked lists have no intersection at all, return null.
+- The linked lists must retain their original structure after the function returns.
+- You may assume there are no cycles anywhere in the entire linked structure.
+- Your code should preferably run in O(n) time and use only O(1) memory.

Algorithms/0160.intersection-of-two-linked-lists/2.png

@@ -0,0 +1,10 @@
+package problem0160
+
+import "github.com/aQuaYi/LeetCode-in-Go/kit"
+
+// ListNode is pre-defined...
+type ListNode = kit.ListNode
+
+func getIntersectionNode(headA, headB *ListNode) *ListNode {
+	return nil
+}

Algorithms/0160.intersection-of-two-linked-lists/3.png

@@ -0,0 +1,83 @@
+package problem0160
+
+import (
+	"testing"
+
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	a, b   []int
+	ea, eb int
+}{
+
+	{
+		[]int{4, 1, 8, 4, 5},
+		[]int{5, 0, 1, 8, 4, 5},
+		2,
+		3,
+	},
+
+	{
+		[]int{0, 9, 1, 2, 4},
+		[]int{3, 2, 4},
+		3,
+		1,
+	},
+
+	{
+		[]int{2, 6, 4},
+		[]int{1, 5},
+		3,
+		2,
+	},
+
+	// 可以有多个 testcase
+}
+
+// head must Not be nil
+func tailOf(head *ListNode) *ListNode {
+	for head.Next != nil {
+		head = head.Next
+	}
+	return head
+}
+
+func Test_getIntersectionNode(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		tail := kit.Ints2List(tc.a[tc.ea:])
+
+		headA := kit.Ints2List(tc.a[:tc.ea])
+		tailA := tailOf(headA)
+		tailA.Next = tail
+
+		headB := kit.Ints2List(tc.b[:tc.eb])
+		tailB := tailOf(headB)
+		tailB.Next = tail
+
+		ast.Equal(tail, getIntersectionNode(headA, headB), "输入:%v", tc)
+	}
+}
+
+func Benchmark_getIntersectionNode(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			tail := kit.Ints2List(tc.a[tc.ea:])
+
+			headA := kit.Ints2List(tc.a[:tc.ea])
+			tailA := tailOf(headA)
+			tailA.Next = tail
+
+			headB := kit.Ints2List(tc.b[:tc.eb])
+			tailB := tailOf(headB)
+			tailB.Next = tail
+
+			getIntersectionNode(headA, headB)
+		}
+	}
+}

Algorithms/0160.intersection-of-two-linked-lists/README.md

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
-	"Ranking": 873,
-	"Updated": "2019-04-15T21:58:56.384624711+08:00",
+	"Ranking": 863,
+	"Updated": "2019-04-16T19:39:08.862122497+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 219,
@@ -181,7 +181,7 @@
 			"ID": 13,
 			"Title": "Roman to Integer",
 			"TitleSlug": "roman-to-integer",
-			"PassRate": "51%",
+			"PassRate": "52%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -961,7 +961,7 @@
 			"ID": 78,
 			"Title": "Subsets",
 			"TitleSlug": "subsets",
-			"PassRate": "51%",
+			"PassRate": "52%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -5953,7 +5953,7 @@
 			"ID": 494,
 			"Title": "Target Sum",
 			"TitleSlug": "target-sum",
-			"PassRate": "44%",
+			"PassRate": "45%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8185,7 +8185,7 @@
 			"ID": 680,
 			"Title": "Valid Palindrome II",
 			"TitleSlug": "valid-palindrome-ii",
-			"PassRate": "33%",
+			"PassRate": "34%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9949,7 +9949,7 @@
 			"ID": 827,
 			"Title": "Making A Large Island",
 			"TitleSlug": "making-a-large-island",
-			"PassRate": "42%",
+			"PassRate": "43%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11137,7 +11137,7 @@
 			"ID": 926,
 			"Title": "Flip String to Monotone Increasing",
 			"TitleSlug": "flip-string-to-monotone-increasing",
-			"PassRate": "48%",
+			"PassRate": "49%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11389,7 +11389,7 @@
 			"ID": 947,
 			"Title": "Most Stones Removed with Same Row or Column",
 			"TitleSlug": "most-stones-removed-with-same-row-or-column",
-			"PassRate": "53%",
+			"PassRate": "54%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11737,7 +11737,7 @@
 			"ID": 976,
 			"Title": "Largest Perimeter Triangle",
 			"TitleSlug": "largest-perimeter-triangle",
-			"PassRate": "56%",
+			"PassRate": "57%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -12277,7 +12277,7 @@
 			"ID": 1021,
 			"Title": "Remove Outermost Parentheses",
 			"TitleSlug": "remove-outermost-parentheses",
-			"PassRate": "80%",
+			"PassRate": "79%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -12289,7 +12289,7 @@
 			"ID": 1022,
 			"Title": "Sum of Root To Leaf Binary Numbers",
 			"TitleSlug": "sum-of-root-to-leaf-binary-numbers",
-			"PassRate": "45%",
+			"PassRate": "46%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -12337,7 +12337,7 @@
 			"ID": 1026,
 			"Title": "Maximum Difference Between Node and Ancestor",
 			"TitleSlug": "maximum-difference-between-node-and-ancestor",
-			"PassRate": "55%",
+			"PassRate": "56%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -12349,7 +12349,7 @@
 			"ID": 1027,
 			"Title": "Longest Arithmetic Sequence",
 			"TitleSlug": "longest-arithmetic-sequence",
-			"PassRate": "41%",
+			"PassRate": "43%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,