{"id":7149,"date":"2020-07-25T22:38:17","date_gmt":"2020-07-26T05:38:17","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=7149"},"modified":"2020-07-25T22:46:49","modified_gmt":"2020-07-26T05:46:49","slug":"1528-shuffle-string","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/1528-shuffle-string\/","title":{"rendered":"\u82b1\u82b1\u9171 1528. Shuffle String"},"content":{"rendered":"\n

Given a string s<\/code> and an integer array indices<\/code> of the same length<\/strong>.<\/p>\n\n\n\n

The string s<\/code> will be shuffled such that the character at the ith<\/sup><\/code> position moves to indices[i]<\/code> in the shuffled string.<\/p>\n\n\n\n

Return the shuffled string<\/em>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> s = \"codeleet\", indices<\/code> = [4,5,6,7,0,2,1,3]\nOutput:<\/strong> \"leetcode\"\nExplanation:<\/strong> As shown, \"codeleet\" becomes \"leetcode\" after shuffling.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> s = \"abc\", indices<\/code> = [0,1,2]\nOutput:<\/strong> \"abc\"\nExplanation:<\/strong> After shuffling, each character remains in its position.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> s = \"aiohn\", indices<\/code> = [3,1,4,2,0]\nOutput:<\/strong> \"nihao\"\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input:<\/strong> s = \"aaiougrt\", indices<\/code> = [4,0,2,6,7,3,1,5]\nOutput:<\/strong> \"arigatou\"\n<\/pre>\n\n\n\n
Example 5:<\/strong><\/p>\n\n\n\n
Input:<\/strong> s = \"art\", indices<\/code> = [1,0,2]\nOutput:<\/strong> \"rat\"\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • s.length == indices.length == n<\/code><\/li>
  • 1 <= n <= 100<\/code><\/li>
  • s<\/code> contains only lower-case English letters.<\/li>
  • 0 <= indices[i] < n<\/code><\/li>
  • All values of indices<\/code> are unique (i.e. indices<\/code> is a permutation of the integers from 0<\/code> to n - 1<\/code>).<\/li><\/ul>\n\n\n\n
    Solution: Simulation<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  string restoreString(string s, vector& indices) {\n    string ans(s);\n    for (int i = 0; i < indices.size(); ++i)\n      ans[indices[i]] = s[i];\n    return ans;\n  }\n};\n<\/pre>\n\n<\/div>
    Java<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\n  public String restoreString(String s, int[] indices) {\n    char[] ans = new char[s.length()];\n    for (int i = 0; i < s.length(); ++i)\n      ans[indices[i]] = s.charAt(i);\n    return new String(ans);\n  }\n}\n<\/pre>\n\n<\/div>
    Pyhton3<\/h2>\n
    \n\n
    \nclass Solution:\n  def restoreString(self, s: str, indices: List[int]) -> str:\n    ans = [None] * len(s)\n    for i, idx in enumerate(indices):\n      ans[idx] = s[i]\n    return ''.join(ans)\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[222,179,4],"class_list":["post-7149","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-easy","tag-simulation","tag-string","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7149","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=7149"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7149\/revisions"}],"predecessor-version":[{"id":7153,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7149\/revisions\/7153"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=7149"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=7149"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=7149"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}