描述
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"
Note:
- s.length == indices.length == n
- 1 <= n <= 100
- s contains only lower-case English letters.
- 0 <= indices[i] < n
- All values of indices are unique (i.e. indices is a permutation of the integers from 0 to n - 1).
解析
根据题意，s 和 indices 的值一一对应，indices 中的每个数字表示 s 中对应的字母在结果中的索引，如 s = "aiohn", indices = [3,1,4,2,0]，其中的 3 表示 a 在结果字符串中的索引为 3 ，1 表示 i 在结果字符串中的索引为 1 ，按照这个规律解决即可得到 "nihao" 。
解答
class Solution(object):
def restoreString(self, s, indices):
"""
:type s: str
:type indices: List[int]
:rtype: str
"""
n = len(indices)
res = [None] * n
for i in range(n):
res[indices[i]] = s[i]
return "".join(res)
运行结果
Runtime: 36 ms, faster than 85.18% of Python online submissions for Shuffle String.
Memory Usage: 13.5 MB, less than 37.77% of Python online submissions for Shuffle String.
原题链接：leetcode.com/problems/sh…
每日格言：人生最大遗憾莫过于错误坚持和轻易放弃
