LC 977 有序数组的平方
class Solution {
public:
vector<int> sortedSquares_b(vector<int>& nums) {
vector<int> res;
int e = 0, s;
for(;e<nums.size(); e++){
if(nums[e]>=0) break;
}
s = e - 1;
while(s>=0 || e<nums.size()){
if((e==nums.size())||(s>=0 && nums[s] + nums[e] > 0)){
res.push_back(nums[s] * nums[s]);
s--;
}
else{
res.push_back(nums[e] * nums[e]);
e++;
}
}
return res;
}
// 从两边到中间的双指针,指针初始化在for内部!
vector<int> sortedSquares(vector<int>& nums) {
vector<int> res(nums.size());
int ind = nums.size() - 1;
for(int s = 0, e = nums.size() - 1; s<=e;){
if(nums[s] + nums[e] > 0){
res[ind--] = nums[e] * nums[e];
e--;
}
else{
res[ind--] = nums[s] * nums[s];
s++;
}
}
return res;
}
};
LC 209 长度最小的子数组
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int len = nums.size(), sum = 0, s=0;
for(int e=0; e<nums.size(); e++){
sum += nums[e];
while(sum >= target){
len = min(len, e - s +1);
sum -= nums[s];
s++;
}
}
return s==0 ? 0 : len;
}
};
LC 59 螺旋矩阵 II
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n, vector<int> (n,0));
int cnt = 1, i=0, j=0;
while(cnt<=n*n){
// cout<<cnt<<i<<j;
res[i][j] = cnt;
if(i<=(n-1)/2){
if(i>0 && res[i-1][j]==0) i--;
else if(j<n-1 && res[i][j+1]==0) j++;
else if(i<n-1 &&res[i+1][j]==0) i++;
}else{
if(i<n-1 && res[i+1][j]==0) i++;
else if(j>0 && res[i][j-1]==0) j--;
else if(i>0 &&res[i-1][j]==0) i--;
}
cnt++;
}
return res;
}
};