0936 finish

Author: aQuaYi

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

@@ -2,13 +2,13 @@
 
 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.
+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.
+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.)
+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.
+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".
 

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

@@ -5,11 +5,12 @@ import "strings"
 // ref: https://leetcode.com/problems/stamping-the-sequence/discuss/189254/Python-Greedy-and-DFS
 
 func movesToStamp(stamp string, target string) []int {
-	t, s := []byte(target), []byte(stamp)
-	tSize, sSize := len(t), len(s)
+	s, t := []byte(stamp), []byte(target)
+	sSize, tSize := len(stamp), len(target)
 
-	res := make([]int, 0, tSize)
+	res := make([]int, 0, 1000)
 
+	// isStamped return true if stamped since i
 	isStamped := func(i int) bool {
 		canStamp := false
 		for j := 0; j < sSize; j++ {
@@ -30,11 +31,16 @@ func movesToStamp(stamp string, target string) []int {
 		return canStamp
 	}
 
-	changed := true
-	for changed {
-		changed = false
-		for i := 0; i < tSize-sSize+1; i++ {
-			changed = changed || isStamped(i)
+	maxIndex := tSize - sSize + 1
+
+	for {
+		isChanged := false
+		for i := 0; i < maxIndex; i++ {
+			isChanged = isChanged || isStamped(i)
+		}
+		if !isChanged {
+			// no more place to stamp
+			break
 		}
 	}
 

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

@@ -13,6 +13,11 @@ var tcs = []struct {
 	target string
 }{
 
+	{
+		"ab",
+		"aba",
+	},
+
 	{
 		"abc",
 		"ababc",
@@ -23,10 +28,7 @@ var tcs = []struct {
 		"aabcaca",
 	},
 
-	{
-		"ab",
-		"aba",
-	},
+	//
 }
 
 func isCorrect(stamp, target string, sequence []int) bool {