Merge pull request #201 from bumblebee211196/develop

✨ Add solution and testcases to problem 791

Author: Cori1109

leetcode/701-800/0791.Custom-Sort-String/README.md

@@ -1,15 +1,20 @@
 # [791.Custom Sort String][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
 
+order and str are strings composed of lowercase letters. In order, no letter occurs more than once.
+
+order was sorted in some custom order previously. We want to permute the characters of str so that they match the order that order was sorted. More specifically, if x occurs before y in order, then x should occur before y in the returned string.
+
+Return any permutation of str (as a string) that satisfies this property.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: 
+order = "cba"
+str = "abcd"
+Output: "cbad"
 ```
 
 ## 题意

leetcode/701-800/0791.Custom-Sort-String/Solution.go

@@ -1,5 +1,15 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "sort"
+
+func Solution(order string, str string) string {
+    mapper := make(map[byte]int)
+    for i:= range order {
+        mapper[order[i]] = i - 26
+    }
+    res := []byte(str)
+    sort.Slice(res, func(i, j int) bool {
+        return mapper[res[i]] < mapper[res[j]]
+    })
+    return string(res)
 }

leetcode/701-800/0791.Custom-Sort-String/Solution_test.go

@@ -10,21 +10,21 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		order  string
+		str    string
+		expect string
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", "cba", "abcd", "cbad"},
+		{"TestCase", "bee", "bumblebee", "bbbeeelum"},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.order, c.str)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",
+					c.expect, got, c.order, c.str)
 			}
 		})
 	}