feat: add solutions to lc problem: No.1409.Queries on a Permutation With Key

Author: yanglbme

solution/1400-1499/1409.Queries on a Permutation With Key/README.md

@@ -51,27 +51,104 @@
 	<li><code>1 &lt;= queries[i] &lt;= m</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+题目数据规模不大，直接模拟即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def processQueries(self, queries: List[int], m: int) -> List[int]:
+        nums = list(range(1, m + 1))
+        res = []
+        for num in queries:
+            res.append(nums.index(num))
+            nums.remove(num)
+            nums.insert(0, num)
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] processQueries(int[] queries, int m) {
+        List<Integer> nums = new LinkedList<>();
+        for (int i = 0; i < m; ++i) {
+            nums.add(i + 1);
+        }
+        int[] res = new int[queries.length];
+        int i = 0;
+        for (int num : queries) {
+            res[i++] = nums.indexOf(num);
+            nums.remove(Integer.valueOf(num));
+            nums.add(0, num);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> processQueries(vector<int>& queries, int m) {
+        vector<int> nums(m);
+        iota(nums.begin(), nums.end(), 1);
+        vector<int> res;
+        for (int num : queries)
+        {
+            int idx = -1;
+            for (int i = 0; i < m; ++i)
+            {
+                if (nums[i] == num) {
+                    idx = i;
+                    break;
+                }
+            }
+            res.push_back(idx);
+            nums.erase(nums.begin() + idx);
+            nums.insert(nums.begin(), num);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func processQueries(queries []int, m int) []int {
+	nums := make([]int, m)
+	for i := 0; i < m; i++ {
+		nums[i] = i + 1
+	}
+	var res []int
+	for _, num := range queries {
+		idx := -1
+		for i := 0; i < m; i++ {
+			if nums[i] == num {
+				idx = i
+				break
+			}
+		}
+		res = append(res, idx)
+		nums = append(nums[:idx], nums[idx+1:]...)
+		nums = append([]int{num}, nums...)
+	}
+	return res
+}
 ```
 
 ### **...**

solution/1400-1499/1409.Queries on a Permutation With Key/README_EN.md

@@ -6,25 +6,17 @@
 
 <p>Given the array <code>queries</code> of positive integers between <code>1</code> and <code>m</code>, you have to process all <code>queries[i]</code> (from <code>i=0</code> to <code>i=queries.length-1</code>) according to the following rules:</p>
 
-
-
 <ul>
 	<li>In the beginning, you have the permutation <code>P=[1,2,3,...,m]</code>.</li>
 	<li>For the current <code>i</code>, find the position of <code>queries[i]</code> in the permutation <code>P</code> (<strong>indexing from 0</strong>) and then move this at the beginning of the permutation <code>P.</code>&nbsp;Notice that the position of <code>queries[i]</code> in <code>P</code> is the result for <code>queries[i]</code>.</li>
 </ul>
 
-
-
 <p>Return an array containing the result for the given <code>queries</code>.</p>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> queries = [3,1,2,1], m = 5
@@ -45,12 +37,8 @@ Therefore, the array containing the result is [2,1,2,1].
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> queries = [4,1,2,2], m = 4
@@ -59,12 +47,8 @@ Therefore, the array containing the result is [2,1,2,1].
 
 </pre>
 
-
-
 <p><strong>Example 3:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> queries = [7,5,5,8,3], m = 8
@@ -73,14 +57,10 @@ Therefore, the array containing the result is [2,1,2,1].
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Constraints:</strong></p>
 
-
-
 <ul>
 	<li><code>1 &lt;= m &lt;= 10^3</code></li>
 	<li><code>1 &lt;= queries.length &lt;= m</code></li>
@@ -94,13 +74,89 @@ Therefore, the array containing the result is [2,1,2,1].
 ### **Python3**
 
 ```python
-
+class Solution:
+    def processQueries(self, queries: List[int], m: int) -> List[int]:
+        nums = list(range(1, m + 1))
+        res = []
+        for num in queries:
+            res.append(nums.index(num))
+            nums.remove(num)
+            nums.insert(0, num)
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] processQueries(int[] queries, int m) {
+        List<Integer> nums = new LinkedList<>();
+        for (int i = 0; i < m; ++i) {
+            nums.add(i + 1);
+        }
+        int[] res = new int[queries.length];
+        int i = 0;
+        for (int num : queries) {
+            res[i++] = nums.indexOf(num);
+            nums.remove(Integer.valueOf(num));
+            nums.add(0, num);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> processQueries(vector<int>& queries, int m) {
+        vector<int> nums(m);
+        iota(nums.begin(), nums.end(), 1);
+        vector<int> res;
+        for (int num : queries)
+        {
+            int idx = -1;
+            for (int i = 0; i < m; ++i)
+            {
+                if (nums[i] == num) {
+                    idx = i;
+                    break;
+                }
+            }
+            res.push_back(idx);
+            nums.erase(nums.begin() + idx);
+            nums.insert(nums.begin(), num);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func processQueries(queries []int, m int) []int {
+	nums := make([]int, m)
+	for i := 0; i < m; i++ {
+		nums[i] = i + 1
+	}
+	var res []int
+	for _, num := range queries {
+		idx := -1
+		for i := 0; i < m; i++ {
+			if nums[i] == num {
+				idx = i
+				break
+			}
+		}
+		res = append(res, idx)
+		nums = append(nums[:idx], nums[idx+1:]...)
+		nums = append([]int{num}, nums...)
+	}
+	return res
+}
 ```
 
 ### **...**

solution/1400-1499/1409.Queries on a Permutation With Key/Solution.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<int> processQueries(vector<int>& queries, int m) {
+        vector<int> nums(m);
+        iota(nums.begin(), nums.end(), 1);
+        vector<int> res;
+        for (int num : queries)
+        {
+            int idx = -1;
+            for (int i = 0; i < m; ++i)
+            {
+                if (nums[i] == num) {
+                    idx = i;
+                    break;
+                }
+            }
+            res.push_back(idx);
+            nums.erase(nums.begin() + idx);
+            nums.insert(nums.begin(), num);
+        }
+        return res;
+    }
+};

solution/1400-1499/1409.Queries on a Permutation With Key/Solution.go

@@ -0,0 +1,20 @@
+func processQueries(queries []int, m int) []int {
+	nums := make([]int, m)
+	for i := 0; i < m; i++ {
+		nums[i] = i + 1
+	}
+	var res []int
+	for _, num := range queries {
+		idx := -1
+		for i := 0; i < m; i++ {
+			if nums[i] == num {
+				idx = i
+				break
+			}
+		}
+		res = append(res, idx)
+		nums = append(nums[:idx], nums[idx+1:]...)
+		nums = append([]int{num}, nums...)
+	}
+	return res
+}

solution/1400-1499/1409.Queries on a Permutation With Key/Solution.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int[] processQueries(int[] queries, int m) {
+        List<Integer> nums = new LinkedList<>();
+        for (int i = 0; i < m; ++i) {
+            nums.add(i + 1);
+        }
+        int[] res = new int[queries.length];
+        int i = 0;
+        for (int num : queries) {
+            res[i++] = nums.indexOf(num);
+            nums.remove(Integer.valueOf(num));
+            nums.add(0, num);
+        }
+        return res;
+    }
+}

solution/1400-1499/1409.Queries on a Permutation With Key/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def processQueries(self, queries: List[int], m: int) -> List[int]:
+        nums = list(range(1, m + 1))
+        res = []
+        for num in queries:
+            res.append(nums.index(num))
+            nums.remove(num)
+            nums.insert(0, num)
+        return res