952 added

Author: aQuaYi

Algorithms/0952.largest-component-size-by-common-factor/1.png

@@ -0,0 +1,40 @@
+# [952. Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor/)
+
+Given a non-empty array of unique positive integers `A`, consider the following graph:
+
+- There are `A.length` nodes, labelled `A[0]` to `A[A.length - 1]`;
+- There is an edge between `A[i]` and `A[j]` if and only if `A[i]` and `A[j]` share a common factor greater than 1.
+
+Return the size of the largest connected component in the graph.
+
+Example 1:
+
+```text
+Input: [4,6,15,35]
+Output: 4
+```
+
+![example1](1.png)
+
+Example 2:
+
+```text
+Input: [20,50,9,63]
+Output: 2
+```
+
+![example2](2.png)
+
+Example 3:
+
+```text
+Input: [2,3,6,7,4,12,21,39]
+Output: 8
+```
+
+![example3](3.png)
+
+Note:
+
+1. `1 <= A.length <= 20000`
+1. `1 <= A[i] <= 100000`

Algorithms/0952.largest-component-size-by-common-factor/2.png

@@ -0,0 +1,6 @@
+package problem0952
+
+func largestComponentSize(A []int) int {
+
+	return 0
+}

Algorithms/0952.largest-component-size-by-common-factor/3.png

@@ -0,0 +1,47 @@
+package problem0952
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	A   []int
+	ans int
+}{
+
+	{
+		[]int{4, 6, 15, 35},
+		4,
+	},
+
+	{
+		[]int{20, 50, 9, 63},
+		2,
+	},
+
+	{
+		[]int{2, 3, 6, 7, 4, 12, 21, 39},
+		8,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_largestComponentSize(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, largestComponentSize(tc.A), "输入:%v", tc)
+	}
+}
+
+func Benchmark_largestComponentSize(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			largestComponentSize(tc.A)
+		}
+	}
+}

Algorithms/0952.largest-component-size-by-common-factor/README.md

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 903,
-	"Updated": "2019-02-06T12:54:02.888667396+08:00",
+	"Updated": "2019-02-07T12:28:30.824001131+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 211,
@@ -1057,7 +1057,7 @@
 			"ID": 86,
 			"Title": "Partition List",
 			"TitleSlug": "partition-list",
-			"PassRate": "35%",
+			"PassRate": "36%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -1693,7 +1693,7 @@
 			"ID": 139,
 			"Title": "Word Break",
 			"TitleSlug": "word-break",
-			"PassRate": "33%",
+			"PassRate": "34%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -2941,7 +2941,7 @@
 			"ID": 243,
 			"Title": "Shortest Word Distance",
 			"TitleSlug": "shortest-word-distance",
-			"PassRate": "55%",
+			"PassRate": "56%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -3973,7 +3973,7 @@
 			"ID": 329,
 			"Title": "Longest Increasing Path in a Matrix",
 			"TitleSlug": "longest-increasing-path-in-a-matrix",
-			"PassRate": "38%",
+			"PassRate": "39%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -5581,7 +5581,7 @@
 			"ID": 463,
 			"Title": "Island Perimeter",
 			"TitleSlug": "island-perimeter",
-			"PassRate": "59%",
+			"PassRate": "60%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -6145,7 +6145,7 @@
 			"ID": 510,
 			"Title": "Inorder Successor in BST II",
 			"TitleSlug": "inorder-successor-in-bst-ii",
-			"PassRate": "61%",
+			"PassRate": "60%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -6217,7 +6217,7 @@
 			"ID": 516,
 			"Title": "Longest Palindromic Subsequence",
 			"TitleSlug": "longest-palindromic-subsequence",
-			"PassRate": "44%",
+			"PassRate": "45%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -6793,7 +6793,7 @@
 			"ID": 564,
 			"Title": "Find the Closest Palindrome",
 			"TitleSlug": "find-the-closest-palindrome",
-			"PassRate": "18%",
+			"PassRate": "17%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -7477,7 +7477,7 @@
 			"ID": 621,
 			"Title": "Task Scheduler",
 			"TitleSlug": "task-scheduler",
-			"PassRate": "43%",
+			"PassRate": "44%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -7825,7 +7825,7 @@
 			"ID": 650,
 			"Title": "2 Keys Keyboard",
 			"TitleSlug": "2-keys-keyboard",
-			"PassRate": "45%",
+			"PassRate": "46%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -7969,7 +7969,7 @@
 			"ID": 662,
 			"Title": "Maximum Width of Binary Tree",
 			"TitleSlug": "maximum-width-of-binary-tree",
-			"PassRate": "40%",
+			"PassRate": "39%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8101,7 +8101,7 @@
 			"ID": 673,
 			"Title": "Number of Longest Increasing Subsequence",
 			"TitleSlug": "number-of-longest-increasing-subsequence",
-			"PassRate": "32%",
+			"PassRate": "33%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8605,7 +8605,7 @@
 			"ID": 715,
 			"Title": "Range Module",
 			"TitleSlug": "range-module",
-			"PassRate": "33%",
+			"PassRate": "34%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9949,7 +9949,7 @@
 			"ID": 827,
 			"Title": "Making A Large Island",
 			"TitleSlug": "making-a-large-island",
-			"PassRate": "41%",
+			"PassRate": "42%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10297,7 +10297,7 @@
 			"ID": 856,
 			"Title": "Score of Parentheses",
 			"TitleSlug": "score-of-parentheses",
-			"PassRate": "55%",
+			"PassRate": "54%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10765,7 +10765,7 @@
 			"ID": 895,
 			"Title": "Maximum Frequency Stack",
 			"TitleSlug": "maximum-frequency-stack",
-			"PassRate": "50%",
+			"PassRate": "51%",
 			"Difficulty": "Hard",
 			"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": "52%",
+			"PassRate": "53%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11437,7 +11437,7 @@
 			"ID": 951,
 			"Title": "Flip Equivalent Binary Trees",
 			"TitleSlug": "flip-equivalent-binary-trees",
-			"PassRate": "64%",
+			"PassRate": "65%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11701,7 +11701,7 @@
 			"ID": 973,
 			"Title": "K Closest Points to Origin",
 			"TitleSlug": "k-closest-points-to-origin",
-			"PassRate": "67%",
+			"PassRate": "66%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11857,7 +11857,7 @@
 			"ID": 986,
 			"Title": "Interval List Intersections",
 			"TitleSlug": "interval-list-intersections",
-			"PassRate": "57%",
+			"PassRate": "58%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11869,7 +11869,7 @@
 			"ID": 987,
 			"Title": "Vertical Order Traversal of a Binary Tree",
 			"TitleSlug": "vertical-order-traversal-of-a-binary-tree",
-			"PassRate": "33%",
+			"PassRate": "32%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11881,7 +11881,7 @@
 			"ID": 988,
 			"Title": "Smallest String Starting From Leaf",
 			"TitleSlug": "smallest-string-starting-from-leaf",
-			"PassRate": "52%",
+			"PassRate": "51%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,