20220323补卡-AC算法

1470. 重新排列数组

 

class Solution {
public:
    vector<int> shuffle(vector<int>& nums, int n) 
    {
        vector<int> res(2*n, 0);
        for(int i = 0, j = 0; i < n; ++i)
        {
            res[j++] = nums[i];
            res[j++] = nums[n+i];
        }
        return res;
    }
};

1929. 数组串联

 

class Solution {
public:
    vector<int> getConcatenation(vector<int>& nums) {
  const int n = nums.size();
  nums.resize(2 * n);
  for (int i = n; i < 2 * n; i++)
  nums[i] = nums[i - n];
  return nums;
    }
};

1920. 基于排列构建数组

 

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

1480. 一维数组的动态和

 

class Solution {
public:
    vector<int> runningSum(vector<int>& nums) {
    vector<int> res;
    int sum = 0;
    for(int i = 0;i < nums.size();++i)
    {
        sum += nums[i];
        res.push_back(sum);
    }
    return res;
    }
};

剑指 Offer 58 - II. 左旋转字符串

class Solution {
public:
    string reverseLeftWords(string s, int n) {
        return s.substr(n, s.size() - n) + s.substr(0, n);
    }
};