今天的题都是半个月之前做过一次的, 还是不会, 还是得复习才行
209. 长度最小的子数组
滑动窗口
滑动窗口, 用两个指针i, j, 分别指向区间起始位置和终止位置, 先移动j, 当区间和大于等于target时, 移动i, 并不断更新答案, 直到区间和小于target, 然后再重复. 第二次做题还是有点难以理解
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int ans = INT_MAX;
int i = 0, sum = 0;
for (int j = 0; j < nums.size(); j++) {
sum += nums[j];
while (sum >= target) {
sum -= nums[i];
ans = min(ans, j - i + 1);
i++;
}
}
return ans == INT_MAX ? 0 : ans;
}
};
59. 螺旋矩阵 II
循环不变量
题还是有点绕, 循环条件有点多.
我一开始就按视频里讲的写的while (n / 2)
, 超出时间限制了, 看代码要用loop = n / 2; while ( loop—)
, 想了半天没明白[捂脸]后来又问ai明白.
看评论区说可以声明ans
时就全部赋值成n^2, 这样就不用判断奇偶了, 挺好
不过声明ans
的语法不太会, 二维数组还得复习一下
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
int startX = 0, startY = 0, offset = 1, count = 1, loop = n / 2;
vector<vector<int>> ans(n, vector<int>(n, n * n));
while (loop--) {
int i = startY, j = startX;
for ( ; j < n - offset; j++) {
ans[i][j] = count++;
}
for ( ; i < n - offset; i++) {
ans[i][j] = count++;
}
for ( ; j > startX; j--) {
ans[i][j] = count++;
}
for ( ; i > startY; i--) {
ans[i][j] = count++;
}
startX++;
startY++;
offset++;
}
return ans;
}
};
58. 区间和
前缀和
没学过c语言, 知道scanf会更快, 但是没用过
输入输出都要自己写的还是难一点
把vec前n项和存到数组p里, 计算vec第i到j项的和, 直接用p[j] - p[i - 1];
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n; cin >> n;
vector<int> arr(n);
int sum = 0; vector<int> sum_(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
sum_[i] = sum;
}
int a, b;
while (~scanf("%d%d", &a, &b)) {
int ans;
if (a == 0) ans = sum_[b];
else ans = sum_[b] - sum_[a - 1];
cout << ans << endl;
}
return 0;
}
44. 开发商购买土地
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int sum = 0;
vector<vector<int>> vec(n, vector<int>(m, 0)) ;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> vec[i][j];
sum += vec[i][j];
}
}
vector<int> horizontal(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0 ; j < m; j++) {
horizontal[i] += vec[i][j];
}
}
vector<int> vertical(n, 0);
for (int j = 0; j < n; j++) {
for (int i = 0 ; i < m; i++) {
vertical[j] += vec[i][j];
}
}
int result = INT_MAX;
int horizontalCut = 0;
for (int i = 0 ; i < n; i++) {
horizontalCut += horizontal[i];
result = min(result, abs(sum - horizontalCut - horizontalCut));
}
int verticalCut = 0;
for (int j = 0; j < m; j++) {
verticalCut += vertical[j];
result = min(result, abs(sum - verticalCut - verticalCut));
}
cout << result << endl;
return 0;
}