Add solution and test-cases for problem 3668

Author: 0xff-dev

leetcode/3601-3700/3668.Restore-Finishing-Order/README.md

@@ -1,29 +1,41 @@
 # [3668.Restore Finishing Order][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
+ are given an integer array `order` of length n and an integer array `friends`.
+
+- `order` contains every integer from 1 to `n` **exactly once**, representing the IDs of the participants of a race in their **finishing** order.
+- `friends` contains the IDs of your friends in the race **sorted** in strictly increasing order. Each ID in friends is guaranteed to appear in the `order` array.
+
+Return an array containing your friends' IDs in their **finishing** order.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
-```
 
-## 题意
-> ...
 
-## 题解
+Input: order = [3,1,2,5,4], friends = [1,3,4]
+
+Output: [3,1,4]
+
+Explanation:
+
+The finishing order is [3, 1, 2, 5, 4]. Therefore, the finishing order of your friends is [3, 1, 4].
+```
+
+**Example 2:**
 
-### 思路1
-> ...
-Restore Finishing Order
-```go
 ```
 
 
+Input: order = [1,4,5,3,2], friends = [2,5]
+
+Output: [5,2]
+
+Explanation:
+
+The finishing order is [1, 4, 5, 3, 2]. Therefore, the finishing order of your friends is [5, 2].
+```
+
 ## 结语
 
 如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]

leetcode/3601-3700/3668.Restore-Finishing-Order/Solution.go

@@ -1,5 +1,16 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(order []int, friends []int) []int {
+	friendsMap := make(map[int]struct{})
+	for _, n := range friends {
+		friendsMap[n] = struct{}{}
+	}
+	index := 0
+	for _, n := range order {
+		if _, ok := friendsMap[n]; ok {
+			friends[index] = n
+			index++
+		}
+	}
+	return friends
 }

leetcode/3601-3700/3668.Restore-Finishing-Order/Solution_test.go

@@ -9,31 +9,30 @@ import (
 func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
-		name   string
-		inputs bool
-		expect bool
+		name           string
+		order, friends []int
+		expect         []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []int{3, 1, 2, 5, 4}, []int{1, 3, 4}, []int{3, 1, 4}},
+		{"TestCase2", []int{1, 4, 5, 3, 2}, []int{2, 5}, []int{5, 2}},
 	}
 
 	//	开始测试
 	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.friends)
 			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 5v",
+					c.expect, got, c.order, c.friends)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }