代码随想录刷题第二天 | 977.有序数组的平方 ,209.长度最小的子数组 ,59.螺旋矩阵II
977.有序数组的平方
两个方法 1 平方+快拍 2 双指针
class Solution {
//简单粗暴
public:
vector<int> sortedSquares(vector<int>& nums) {
for(int i = 0;i<nums.size();i++){
nums[i] = nums[i]*nums[i];
}
sort(nums.begin(),nums.end());
return nums;
}
};
class Solution {
//双指针
public:
vector<int> sortedSquares(vector<int>& nums) {
vector<int>new_nums(nums.size(),0);
int k = nums.size()-1;
for(int i = 0,j = nums.size()-1;i<=j;){
if(nums[j]*nums[j]<nums[i]*nums[i]){
new_nums[k--] = nums[i]*nums[i];
i++;
}
else{
new_nums[k--] = nums[j]*nums[j];
j--;
}
}
return new_nums;
}
};
收获
想到要用双指针了,但是傻逼了,我先找最小值,然后从最小值往左右两边找,非常麻烦,各种边界判断,吸取教训
209.长度最小的子数组
想半天,没想出来咋做,所以直接看题解了,有学到蛮多
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
//滑动窗口方法 重点在于循环遍历的j 应该是滑动窗口的终止位置
int i = 0;
int result = INT32_MAX;
int sums = 0; //滑动窗口的大小
int sublength = 0;//滑动窗口的长度
for(int j = 0;j<nums.size();j++){
sums+=nums[j];
while(sums>=target){
sublength = j-i+1;
result = result > sublength ? sublength:result;
sums-=nums[i++];
}
}
return result==INT32_MAX?0:result;
}
};
59.螺旋矩阵II
好难,看题解看半天才看懂,难搞啊,狠狠地记住了左闭右开,一如循环深似海,从此offer是路人
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> matrix(n, vector<int>(n, 0)); // 使用vector定义一个二维数组
int start_x=0 ;int start_y = 0; //初始要走的位置
int loop = n/2;
int offset = 1;
int count = 1;
while(loop--){
int i = start_x;
int j = start_y;
for(j = start_y;j<n-offset;j++){
matrix[start_x][j] = count++;
}
for(i = start_x;i < n-offset;i++){
matrix[i][j] = count++;
}
for(;j>start_y;j--){
matrix[i][j] = count++;
}
for(;i>start_x;i--){
matrix[i][j] = count++;
}
start_x++;
start_y++;
offset++;
}
int mid = n/2;
if (n % 2) {
matrix[mid][mid] = count;
}
return matrix;
}
};