# LeetCode | 1409. Queries on a Permutation With Key查询带键的排列【Python】

LeetCode 1409. Queries on a Permutation With Key查询带键的排列【Medium】【Python】【模拟】

### Problem

LeetCode

Given the array queries of positive integers between 1 and m, you have to process all queries[i] (from i=0 to i=queries.length-1) according to the following rules:

• In the beginning, you have the permutation P=[1,2,3,...,m].
• For the current i, find the position of queries[i] in the permutation P (indexing from 0) and then move this at the beginning of the permutation P. Notice that the position of queries[i] in P is the result for queries[i].

Return an array containing the result for the given queries.

Example 1:

Input: queries = [3,1,2,1], m = 5
Output: [2,1,2,1]
Explanation: The queries are processed as follow:
For i=0: queries[i]=3, P=[1,2,3,4,5], position of 3 in P is 2, then we move 3 to the beginning of P resulting in P=[3,1,2,4,5].
For i=1: queries[i]=1, P=[3,1,2,4,5], position of 1 in P is 1, then we move 1 to the beginning of P resulting in P=[1,3,2,4,5].
For i=2: queries[i]=2, P=[1,3,2,4,5], position of 2 in P is 2, then we move 2 to the beginning of P resulting in P=[2,1,3,4,5].
For i=3: queries[i]=1, P=[2,1,3,4,5], position of 1 in P is 1, then we move 1 to the beginning of P resulting in P=[1,2,3,4,5].
Therefore, the array containing the result is [2,1,2,1].


Example 2:

Input: queries = [4,1,2,2], m = 4
Output: [3,1,2,0]


Example 3:

Input: queries = [7,5,5,8,3], m = 8
Output: [6,5,0,7,5]


Constraints:

• 1 <= m <= 10^3
• 1 <= queries.length <= m
• 1 <= queries[i] <= m

### 问题

• 一开始，排列 P=[1,2,3,…,m]。
• 对于当前的 i ，请你找出待查项 queries[i] 在排列 P 中的位置（下标从 0 开始），然后将其从原位置移动到排列 P 的起始位置（即下标为 0 处）。注意， queries[i] 在 P 中的位置就是 queries[i] 的查询结果。

输入：queries = [3,1,2,1], m = 5



输入：queries = [4,1,2,2], m = 4



输入：queries = [7,5,5,8,3], m = 8



• 1 <= m <= 10^3
• 1 <= queries.length <= m
• 1 <= queries[i] <= m

### 思路

##### Python3代码
from typing import List

class Solution:
def processQueries(self, queries: List[int], m: int) -> List[int]:
p = [x for x in range(1, m + 1)]
res = []

for x in queries:
temp = p.index(x)
num = p[temp]
res.append(temp)
p.remove(p[temp])
p.insert(0, num)
return res


### GitHub链接

Python

• 点赞
• 评论
• 分享
x

海报分享

扫一扫，分享海报

• 收藏
• 手机看

分享到微信朋友圈

x

扫一扫，手机阅读

• 打赏

打赏

Wonz

创作不易，一块就行。

C币 余额
2C币 4C币 6C币 10C币 20C币 50C币
• 一键三连

点赞Mark关注该博主, 随时了解TA的最新博文

©️2020 CSDN 皮肤主题: 像素格子 设计师:CSDN官方博客