Rearrangement string of leetcode simple question

subject

Give you a string s And a Same length Array of integers for indices .
Please rearrange the string s , Among them the first i Characters need to be moved to indices[i] The position indicated .
Return the rearranged string .
Example 1：

Input ：s = “codeleet”, indices = [4,5,6,7,0,2,1,3]
Output ：“leetcode”
explain ： As shown in the figure ,“codeleet” After rearrangement, it becomes “leetcode” .
Example 2：
Input ：s = “abc”, indices = [0,1,2]
Output ：“abc”
explain ： After rearranging , Each character remains in its original place .
Example 3：
Input ：s = “aiohn”, indices = [3,1,4,2,0]
Output ：“nihao”
Example 4：
Input ：s = “aaiougrt”, indices = [4,0,2,6,7,3,1,5]
Output ：“arigatou”
Example 5：
Input ：s = “art”, indices = [1,0,2]
Output ：“rat”
Tips ：
s.length == indices.length == n
1 <= n <= 100
s Contains only lowercase English letters .
0 <= indices[i] < n
indices All values of are unique （ in other words ,indices Is an integer 0 To n - 1 A set of arrangements formed ）.
source ： Power button （LeetCode）

Their thinking

   take indices and s Corresponding element bundle in , Then on indices After sorting , Output s that will do .

class Solution:
    def restoreString(self, s: str, indices: List[int]) -> str:
        d={
    }
        for i,j in zip(indices,s):
            d[i]=j
        return ''.join([d[i] for i in range(len(s))])