复习算法day2
977、有序数组的平方
为了处理非递减顺序数组平方后的大小顺序,从左右两边开始对比平方后的大小,倒序放进创建的result数组中。
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int left = 0;
int right = nums.size() - 1;
int k = nums.size() - 1;
vector<int> result(nums.size(), 0);
for (left, right; left <= right; ) {
if (nums[left] * nums[left] < nums[right] * nums[right]) {
result[k--] = nums[right] * nums[right];
right--;
} else {
result[k--] = nums[left] * nums[left];
left++;
}
}
return result;
}
};
209.长度最小的子数组
双指针,用left和right构建滑动窗口,首先right向右移动,得到第一个符合条件的sum(也可能得不到,result始终为INT_MAX);然后left向右移动,sum逼近target,或者直接小于了target(这种情况while判断一次,size为最开始sum >= target时候的滑动窗口长度);right继续右移,sum再次大于target(或者直接for到结束都没大于target),继续进入while循环。
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int result = INT_MAX;
int size = 0;
int sum = 0;
int left = 0;
int right = 0;
for (right; right < nums.size(); right++) {
sum += nums[right];
while (sum >= target) {
size = (right - left + 1);
sum -= nums[left++];
result = result < size ? result : size;
}
}
return result == INT_MAX ? 0 : result;
}
};
59.螺旋矩阵II
重刷还是卡壳,重点还是要理清楚螺旋的四个方向;
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n ,vector<int>(n));
int startx = 0;
int starty = 0;
int loop = n / 2;
int offset = 1;
int count = 1;
while (loop--) {
int i = startx;
int j = starty;
for (j = starty; j < n - offset; j++) {
res[startx][j] = count++;
}
for (i = startx; i < n - offset; i++) {
res[i][j] = count++;
}
for (; j > starty; j--) {
res[i][j] = count++;
}
for (; i > startx; i--) {
res[i][j] = count++;
}
startx++;
starty++;
offset++;
}
if (n % 2 == 1) res[n / 2][n / 2] = count;
return res;
}
};