之前收藏了极客时间的算法训练营3期 共10周,计划每一课写博客来记录学习,主要形式为
方法类型1
题1
题解
题2
题解
方法类型2
题1
题解
……
题目大体来自leetcode 和 acwing
主要记录和理解代码,所以基本完全搬运了视频题解代码,
个人学习感受体现在大致思路的总结和注释上。
一、前缀和
每一个从后向前,前缀和相减等于k的组合,都是答案、
class Solution {
public:
int numberOfSubarrays(vector<int>& nums, int k) {
int n = nums.size();
vector<int> arr(n + 1);
arr[0] = 0;
for (int i = 1; i <= n; i++) {
arr[i] = arr[i - 1] + nums[i - 1] % 2;//求前缀和数组
}
vector<int> count(n + 1);
int ans = 0;
count[0] = 1;//前缀和为0的点目前有0个
for (int i = 1; i <= n; i++) {
if (arr[i] - k >= 0) ans += count[arr[i] - k];//前缀和为arr[i] - k的点有几个
count[arr[i]]++;//经过了i点,前缀和为i点前缀和的点数加1;
}
return ans;
}
};
求每一个二维区域的面积,再画图减法得到答案。
class NumMatrix {
public:
NumMatrix(vector<vector<int>>& matrix) {
int m = matrix.size();
int n = matrix[0].size();
vector<vector<int>> sum(m + 1, vector<int>(n + 1,0));
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
//计算矩形面积,可以画图帮助理解
sum[i][j] = matrix[i - 1][j - 1] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
}
}
this->sum = sum;
}
int sumRegion(int row1, int col1, int row2, int col2) {
row1++;
row2++;
col1++;
col2++;
//利用前缀和数组,先都向后推1;
return sum[row2][col2] - sum[row2][col1 - 1] - sum[row1 - 1][col2] + sum[row1 - 1][col1 - 1];
}
private:
vector<vector<int>> sum;
};
/**
* Your NumMatrix object will be instantiated and called as such:
* NumMatrix* obj = new NumMatrix(matrix);
* int param_1 = obj->sumRegion(row1,col1,row2,col2);
*/
3.航班预订统计
利用差分记录变化量,再求前缀和变为答案。
class Solution {
public:
vector<int> corpFlightBookings(vector<vector<int>>& bookings, int n) {
vector<int> delta(n + 2);
for (vector<int>& booking : bookings) {
int begin = booking[0];
int end = booking[1];
int seat = booking[2];
delta[begin] += seat;//差分,记录变化量
delta[end + 1] -= seat;
}
vector<int> sum(n, 0);
/*
差分正常思路,从下标1开始,每个元素等于前一元素加差分,即变化量
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + delta[i];
}
答案去掉开头的0
*/
sum[0] = delta[1];
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1] + delta[i + 1];
}
return sum;
}
};
二。双指针
有序直接扫描
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int i = 0;
int j = numbers.size() - 1;
for (int i = 0; i < numbers.size(); i++) {
while(numbers[i] + numbers[j] > target) j--;
if (numbers[i] + numbers[j] == target) return {i + 1, j + 1};
}
return {};
}
};
2. 两数之和
力扣第一题,带着索引排序,然后双指针
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<pair<int, int>> pairs;
// <value, index>
int n = nums.size();
for (int i = 0; i <n; i++) {
pairs.push_back({nums[i], i});
}
//让数值带着标号一起排序
sort(pairs.begin(), pairs.end());
int j = n - 1;
//双指针
for (int i = 0; i < n; i++) {
while (i < j && pairs[i].first + pairs[j].first > target) j--;
if (i < j && pairs[i].first + pairs[j].first == target) return{pairs[i].second, pairs[j].second};
}
return {};
}
};
3.三数之和
嵌套嵌套
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(), nums.end());//排个序又能做双指针
vector<vector<int>> ans;
//对于每一个第三数,找前两个数,嵌套起来。
for (int i = 0 ;i < nums.size(); i++) {
if (i > 0 && nums[i] == nums[i - 1]) continue;//最后检查去重
vector<vector<int>> jks = twoSum(nums, i + 1, -nums[i]);
for (vector<int>& jk : jks)
ans.push_back({nums[i], jk[0], jk[1]});
}
return ans;
}
private:
vector<vector<int>> twoSum(vector<int>& nums, int begin, int target) {
vector<vector<int>> ans;
int j = nums.size() - 1;
for (int i = begin; i < nums.size(); i++) {
if (i > begin && nums[i] == nums[i - 1]) continue;
while(i < j && nums[i] + nums[j] > target) j--;
if (i < j && nums[i] + nums[j] == target) ans.push_back({nums[i], nums[j]});
}
return ans;
}
};
4.盛最多水的容器
双指针,水桶长板留下
class Solution {
public:
int maxArea(vector<int>& height) {
int n = height.size();
int i = 0;
int j = n - 1;
int ans = 0;
while (i < j) {
ans = max(ans, min(height[i], height[j]) * (j - i));
height[i] < height[j] ? i++: j--;
}
return ans;
}
};