有序数组的平方
代码随想录文章讲解[有序数组的平方](https://www.programmercarl.com/0977.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE) Leetcode题目[有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array/)
思路
暴力法:先平方,后排序
双指针法:
分析:数组原本有序,平方后可能原本为负的数变为最大的数,但大数必然在两端出现
做法:左指针和右指针指向的数平方进行比较,更大的送到后面的位置
暴力法
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
for(int i=0; i<nums.size(); i++){
nums[i] *= nums[i];
}
sort(nums.begin(), nums.end());
return nums;
}
};
双指针法
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int left = 0, right = nums.size() - 1, sleft = 0, sright = 0;
int i = nums.size() - 1;
vector<int> res(nums.size(),0);
while(left<right){
sleft = nums[left] * nums[left];
sright = nums[right] * nums[right];
if(sleft>=sright){
res[i] = sleft;
left++;
}else{
res[i] = sright;
right--;
}
i--;
}
return res;
}
};
长度最小的子数组
代码随想录文章讲解[长度最小的子数组](https://www.programmercarl.com/0209.%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.html) Leetcode题目[长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/)
思路
暴力法:双循环
滑动窗口法:
调节起始指针和终止指针位置得到结果
做法:for循环表示终止指针位置,动态调整sum
暴力法
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int res = INT32_MAX;
int sum = 0, len = 0;
for(int i=0; i<nums.size(); i++){
sum = 0;
for(int j=i; j<nums.size(); j++){
sum += nums[j];
if(sum>=target){
len = j - i + 1;
break;
}
}
res = len<res ? len:res;
}
return res;
}
};
滑动窗口法
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int res = INT32_MAX;
int sum = 0, len = 0;
int left = 0, right = 0;
for(; right<nums.size(); right++){
sum += nums[right];
while(sum>=target){
sum -= nums[left];
len = right - left + 1;
left++;
res = res<len ? res:len;
}
}
return res==INT32_MAX ? 0:res;
}
};
螺旋矩阵II
代码随想录文章讲解[螺旋矩阵II](https://www.programmercarl.com/0059.%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5II.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE) Leetcode题目[螺旋矩阵II](https://leetcode.cn/problems/spiral-matrix-ii/)
思路
先考虑螺旋的次数,再以左闭右开的方式进行螺旋,留意奇数行数矩阵的中心值
代码
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n,vector<int>(n,0));
int startx = 0, starty = 0, count = 1;
int mid = n*n, loop = n/2;
while(loop--){
int i = 0, j = 0;
for(; i<n-startx-1; i++){
res[starty][i] = count++;
}
for(; j<n-starty-1; j++){
res[j][n-startx-1] = count++;
}
for(; i>startx; i--){
res[n-starty-1][i] = count++;
}
for(; j>starty; j--){
res[j][startx] = count++;
}
}
if(n%2 == 1){
res[n/2][n/2] = mid;
}
return res;
}
};