class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
vector<int> res(nums.size());
int left = 0;
int right = nums.size() - 1;
int k = right;
while (left <= right) {
if (nums[left] * nums[left] > nums[right] * nums[right]) {
res[k--] = nums[left] * nums[left];
left++;
}else {
res[k--] = nums[right] * nums[right];
right--;
}
}
return res;
}
};
209.长度最小的子数组
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int res = INT32_MAX;
int i = 0;
int sum = 0;
int len = 0;
for (int j = 0; j < nums.size(); j++) {
sum += nums[j];
while (sum >= target) {
len = j - i + 1;
res = res > len ? len : res;
sum -= nums[i++];
}
}
return res == INT32_MAX ? 0 : res;
}
};
59.螺旋矩阵I
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n, vector<int>(n));
int k = n / 2;
int index = 1;
int startx = 0, starty = 0;
int count = 1;
int i, j;
while (k--) {
for (j = starty; j < n - index; j++) {
res[startx][j] = count++;
}
for (i = startx; i < n - index; i++) {
res[i][j] = count++;
}
for (; j > starty; j--) {
res[i][j] = count++;
}
for (; i > startx; i--) {
res[i][j] = count++;
}
++startx;
++starty;
index++;
}
if (n % 2) {
int mid = n / 2;
res[mid][mid] = count;
}
return res;
}
};