Table of Contents
一、中文版
二、英文版
三、My answer
四、解题报告
给你一个字符串 s
和一个 长度相同 的整数数组 indices
。
请你重新排列字符串 s
,其中第 i
个字符需要移动到 indices[i]
指示的位置。
返回重新排列后的字符串。
示例 1:
输入:s = "codeleet", indices
= [4,5,6,7,0,2,1,3]
输出:"leetcode"
解释:如图所示,"codeleet" 重新排列后变为 "leetcode" 。
示例 2:
输入:s = "abc", indices
= [0,1,2]
输出:"abc"
解释:重新排列后,每个字符都还留在原来的位置上。
示例 3:
输入:s = "aiohn", indices
= [3,1,4,2,0]
输出:"nihao"
示例 4:
输入:s = "aaiougrt", indices
= [4,0,2,6,7,3,1,5]
输出:"arigatou"
示例 5:
输入:s = "art", indices
= [1,0,2]
输出:"rat"
提示:
s.length == indices.length == n
1 <= n <= 100
s
仅包含小写英文字母。0 <= indices[i] < n
indices
的所有的值都是唯一的(也就是说,indices
是整数 0
到 n - 1
形成的一组排列)。Given a string s
and an integer array indices
of the same length.
The string s
will be shuffled such that the character at the ith
position moves to indices[i]
in the shuffled string.
Return the shuffled string.
Example 1:
Input: s = "codeleet", indices
= [4,5,6,7,0,2,1,3]
Output: "leetcode"
Explanation: As shown, "codeleet" becomes "leetcode" after shuffling.
Example 2:
Input: s = "abc", indices
= [0,1,2]
Output: "abc"
Explanation: After shuffling, each character remains in its position.
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"
Constraints:
s.length == indices.length == n
1 <= n <= 100
s
contains only lower-case English letters.0 <= indices[i] < n
indices
are unique (i.e. indices
is a permutation of the integers from 0
to n - 1
).class Solution:
def restoreString(self, s: str, indices: List[int]) -> str:
n = len(s)
result = ['0'] * n
for i in range(n):
result[indices[i]] = s[i]
result_str = ''.join(result)
return result_str
数据结构:数组
算法:遍历。需要清楚 indices[i] 是 result 的下标,s[i] 是 result[indices[i]] 的值。
题目特点:字符串 s 和数组 indices 长度相同