数据结构基础训练

一、寻找数组的中心下标

核心算法如下：

class Solution {
public:
    int pivotIndex(vector<int>& nums) {
        int total = 0;
        for (int n : nums) {total += n;}
        int left = 0, right = total;
        for (int i = 0; i < nums.size(); ++i) {
            right -= nums[i];
            if (left == right) { return i;}
            left += nums[i];
        }
        return -1;
    }
};

二、搜索插入位置

核心算法如下：

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size();
        int i = 0;
        for(i ; i < n; ++i){
            while(target == nums[i]){
                return i;
            }
        }
        for(int j = 0; j < n; ++j){
            while(nums[j] >= target){
                return j;
            }
        }
        return n == 0 ? 0 : n;
    }
};

三、合并区间

核心算法如下：

class Solution {
public:
  vector<vector<int>> merge(vector<vector<int>>& intervals) {
    vector<int> h;
    int n = intervals.size(), m = -INT_MAX;
    if (n == 0) return vector<vector<int>>();
    for (int i = 0; i < n; i++) {
      intervals[i][0]++; intervals[i][0] *= 2;
      intervals[i][1]++; intervals[i][1] *= 2;
      h.emplace_back(intervals[i][0]);
      h.emplace_back(intervals[i][1]);
      m = max(m, intervals[i][0]);
      m = max(m, intervals[i][1]);
    }
    vector<int> vis(m + 10, 0);
    for (int i = 0; i < intervals.size(); i++) {
      int l = intervals[i][0], r = intervals[i][1];
      vis[l]++, vis[r + 1]--;
    }
    for (int i = 1; i <= m; i++) {
      vis[i] += vis[i - 1];
    }
    vector<vector<int>> ret;
    for (int i = 1; i <= m; ) {
      while (i <= m && vis[i] == 0) i++;
      int l = i;
      while (i <= m && vis[i] != 0) i++;
      int r = i - 1;
      vector<int> tmp({l / 2 - 1, r / 2 - 1});
      ret.emplace_back(move(tmp));
    }
    return ret;
  }
};

四、题目来源

链接: https://leetcode-cn.com/leetbook/detail/array-and-string/.

五、代码仓库

链接: https://gitee.com/my-do/programming-windows-.