936 added

Author: aQuaYi

Algorithms/0936.stamping-the-sequence/README.md

@@ -0,0 +1,35 @@
+# [936. Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/)
+
+You want to form a target string of lowercase letters.
+
+At the beginning, your sequence is target.length '?' marks.  You also have a stamp of lowercase letters.
+
+On each turn, you may place the stamp over the sequence, and replace every letter in the sequence with the corresponding letter from the stamp.  You can make up to 10 * target.length turns.
+
+For example, if the initial sequence is "?????", and your stamp is "abc",  then you may make "abc??", "?abc?", "??abc" in the first turn.  (Note that the stamp must be fully contained in the boundaries of the sequence in order to stamp.)
+
+If the sequence is possible to stamp, then return an array of the index of the left-most letter being stamped at each turn.  If the sequence is not possible to stamp, return an empty array.
+
+For example, if the sequence is "ababc", and the stamp is "abc", then we could return the answer [0, 2], corresponding to the moves "?????" -> "abc??" -> "ababc".
+
+Also, if the sequence is possible to stamp, it is guaranteed it is possible to stamp within 10 * target.length moves.  Any answers specifying more than this number of moves will not be accepted.
+
+Example 1:
+
+```text
+Input: stamp = "abc", target = "ababc"
+Output: [0,2]
+([1,0,2] would also be accepted as an answer, as well as some other answers.)
+```
+
+Example 2:
+
+```text
+Input: stamp = "abca", target = "aabcaca"
+Output: [3,0,1]
+```
+
+Note:
+
+- 1 <= stamp.length <= target.length <= 1000
+- stamp and target only contain lowercase letters.

Algorithms/0936.stamping-the-sequence/stamping-the-sequence.go

@@ -0,0 +1,6 @@
+package problem0936
+
+func movesToStamp(stamp string, target string) []int {
+
+	return nil
+}

Algorithms/0936.stamping-the-sequence/stamping-the-sequence_test.go

@@ -0,0 +1,45 @@
+package problem0936
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	stamp  string
+	target string
+	ans    []int
+}{
+
+	{
+		"abc",
+		"ababc",
+		[]int{0, 2},
+	},
+
+	{
+		"abca",
+		"aabcaca",
+		[]int{3, 0, 1},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_movesToStamp(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, movesToStamp(tc.stamp, tc.target), "输入:%v", tc)
+	}
+}
+
+func Benchmark_movesToStamp(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			movesToStamp(tc.stamp, tc.target)
+		}
+	}
+}

leetcode.json

@@ -1,23 +1,23 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 927,
-	"Updated": "2019-02-02T23:23:01.193723611+08:00",
+	"Updated": "2019-02-03T13:08:58.697681697+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 210,
-			"Total": 227
+			"Total": 228
 		},
 		"Medium": {
 			"Solved": 351,
-			"Total": 380
+			"Total": 383
 		},
 		"Hard": {
 			"Solved": 155,
 			"Total": 166
 		},
 		"Total": {
 			"Solved": 716,
-			"Total": 773
+			"Total": 777
 		}
 	},
 	"Problems": [
@@ -5509,7 +5509,7 @@
 			"ID": 457,
 			"Title": "Circular Array Loop",
 			"TitleSlug": "circular-array-loop",
-			"PassRate": "26%",
+			"PassRate": "27%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -6049,7 +6049,7 @@
 			"ID": 502,
 			"Title": "IPO",
 			"TitleSlug": "ipo",
-			"PassRate": "36%",
+			"PassRate": "37%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -6145,7 +6145,7 @@
 			"ID": 510,
 			"Title": "Inorder Successor in BST II",
 			"TitleSlug": "inorder-successor-in-bst-ii",
-			"PassRate": "33%",
+			"PassRate": "61%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -6277,7 +6277,7 @@
 			"ID": 521,
 			"Title": "Longest Uncommon Subsequence I ",
 			"TitleSlug": "longest-uncommon-subsequence-i",
-			"PassRate": "56%",
+			"PassRate": "55%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -6661,7 +6661,7 @@
 			"ID": 553,
 			"Title": "Optimal Division",
 			"TitleSlug": "optimal-division",
-			"PassRate": "55%",
+			"PassRate": "54%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -7837,7 +7837,7 @@
 			"ID": 651,
 			"Title": "4 Keys Keyboard",
 			"TitleSlug": "4-keys-keyboard",
-			"PassRate": "49%",
+			"PassRate": "50%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -10657,7 +10657,7 @@
 			"ID": 886,
 			"Title": "Possible Bipartition",
 			"TitleSlug": "possible-bipartition",
-			"PassRate": "39%",
+			"PassRate": "40%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11149,7 +11149,7 @@
 			"ID": 927,
 			"Title": "Three Equal Parts",
 			"TitleSlug": "three-equal-parts",
-			"PassRate": "28%",
+			"PassRate": "29%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11185,7 +11185,7 @@
 			"ID": 930,
 			"Title": "Binary Subarrays With Sum",
 			"TitleSlug": "binary-subarrays-with-sum",
-			"PassRate": "35%",
+			"PassRate": "36%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11677,7 +11677,7 @@
 			"ID": 971,
 			"Title": "Flip Binary Tree To Match Preorder Traversal",
 			"TitleSlug": "flip-binary-tree-to-match-preorder-traversal",
-			"PassRate": "42%",
+			"PassRate": "41%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11725,7 +11725,7 @@
 			"ID": 975,
 			"Title": "Odd Even Jump",
 			"TitleSlug": "odd-even-jump",
-			"PassRate": "50%",
+			"PassRate": "51%",
 			"Difficulty": "Hard",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11809,7 +11809,7 @@
 			"ID": 982,
 			"Title": "Triples with Bitwise AND Equal To Zero",
 			"TitleSlug": "triples-with-bitwise-and-equal-to-zero",
-			"PassRate": "52%",
+			"PassRate": "53%",
 			"Difficulty": "Hard",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -11840,6 +11840,54 @@
 			"IsFavor": false,
 			"IsNew": false,
 			"HasNoGoOption": false
+		},
+		{
+			"ID": 985,
+			"Title": "Sum of Even Numbers After Queries",
+			"TitleSlug": "sum-of-even-numbers-after-queries",
+			"PassRate": "68%",
+			"Difficulty": "Easy",
+			"IsAccepted": false,
+			"IsPaid": false,
+			"IsFavor": false,
+			"IsNew": true,
+			"HasNoGoOption": false
+		},
+		{
+			"ID": 986,
+			"Title": "Interval List Intersections",
+			"TitleSlug": "interval-list-intersections",
+			"PassRate": "53%",
+			"Difficulty": "Medium",
+			"IsAccepted": false,
+			"IsPaid": false,
+			"IsFavor": false,
+			"IsNew": true,
+			"HasNoGoOption": false
+		},
+		{
+			"ID": 987,
+			"Title": "Vertical Order Traversal of a Binary Tree",
+			"TitleSlug": "vertical-order-traversal-of-a-binary-tree",
+			"PassRate": "29%",
+			"Difficulty": "Medium",
+			"IsAccepted": false,
+			"IsPaid": false,
+			"IsFavor": false,
+			"IsNew": true,
+			"HasNoGoOption": false
+		},
+		{
+			"ID": 988,
+			"Title": "Smallest String Starting From Leaf",
+			"TitleSlug": "smallest-string-starting-from-leaf",
+			"PassRate": "48%",
+			"Difficulty": "Medium",
+			"IsAccepted": false,
+			"IsPaid": false,
+			"IsFavor": false,
+			"IsNew": true,
+			"HasNoGoOption": false
 		}
 	]
 }