{"id":6880,"date":"2020-06-06T22:23:19","date_gmt":"2020-06-07T05:23:19","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=6880"},"modified":"2020-06-06T22:23:38","modified_gmt":"2020-06-07T05:23:38","slug":"leetcode-1470-shuffle-the-array","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/leetcode-1470-shuffle-the-array\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1470. Shuffle the Array"},"content":{"rendered":"\n

Given the array nums<\/code> consisting of 2n<\/code> elements in the form [x1<\/sub>,x2<\/sub>,...,xn<\/sub>,y1<\/sub>,y2<\/sub>,...,yn<\/sub>]<\/code>.<\/p>\n\n\n\n

Return the array in the form<\/em> [x1<\/sub>,y1<\/sub>,x2<\/sub>,y2<\/sub>,...,xn<\/sub>,yn<\/sub>]<\/code>.<\/p>\n\n\n\n

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

Input:<\/strong> nums = [2,5,1,3,4,7], n = 3\nOutput:<\/strong> [2,3,5,4,1,7] \nExplanation:<\/strong> Since x1<\/sub>=2, x2<\/sub>=5, x3<\/sub>=1, y1<\/sub>=3, y2<\/sub>=4, y3<\/sub>=7 then the answer is [2,3,5,4,1,7].\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,2,3,4,4,3,2,1], n = 4\nOutput:<\/strong> [1,4,2,3,3,2,4,1]\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,1,2,2], n = 2\nOutput:<\/strong> [1,2,1,2]\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= n <= 500<\/code><\/li>
  • nums.length == 2n<\/code><\/li>
  • 1 <= nums[i] <= 10^3<\/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  vector shuffle(vector& nums, int n) {\n    vector ans(n * 2);\n    for (int i = 0; i < 2 * n; ++i)\n      ans[i] = nums[i \/ 2 + n * (i % 2)];\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given the array nums consisting of 2n elements in the form [x1,x2,…,xn,y1,y2,…,yn]. Return the array in the form [x1,y1,x2,y2,…,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7] Explanation:…<\/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":[20,222,179],"class_list":["post-6880","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-array","tag-easy","tag-simulation","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6880","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=6880"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6880\/revisions"}],"predecessor-version":[{"id":6882,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6880\/revisions\/6882"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=6880"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=6880"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=6880"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}