【九日集训】

1. 重新排列数组

int[] shuffle(int[] nums, int n) {
        int index = 0;
        int[] result = new int[nums.length];
        for (int i = 0; i < n; i++) {
               result[index++] = nums[i];
               result[index++] = nums[n+i];
        }
        return result;
    }

2. 数组串联

  vector<int> getConcatenation(vector<int>& nums) {
        int n = nums.size();
        for (int i = 0; i < n; ++i){
            nums.push_back(nums[i]);
        }
        return nums;
    }

3. 基于排列构建数组`

  vector<int> buildArray(vector<int>& nums) {
        int n = nums.size();
        vector<int> ans;
        for (int i = 0; i < n; ++i){
            ans.push_back(nums[nums[i]]);
        }
        return ans;
    }

4. 一维数组的动态和

 vector<int> runningSum(vector<int>& nums) {
        int n = nums.size();
        for (int i = 1; i < n; i++) {
            nums[i] += nums[i - 1];
        }
        return nums;
    }

5. . 左旋转字符串

 string reverseLeftWords(string s, int n) {
        rotate(s.begin(), s.begin()+n, s.end());
        return s;
    }