class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
for (int &i : nums) {
i = i*i;
}
sort(nums.begin(),nums.end());
return nums;
}
};
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
vector<int> result(nums.size(),0);
int i = 0, j = nums.size() - 1, k = j;
while (i <= j) {
if (nums[i]*nums[i] < nums[j]*nums[j]) {
result[k--] = nums[j]*nums[j];
j--;
}
else{
result[k--] = nums[i]*nums[i];
i++;
}
}
return result;
}
};
class Solution {
public:
int minSubArrayLen(int s, vector<int>& nums) {
int result = INT32_MAX;
int sum = 0;
int subLength = 0;
for (int i = 0; i < nums.size(); i++) {
sum = 0;
for (int j = i; j < nums.size(); j++) {
sum += nums[j];
if (sum >= s) {
subLength = j - i + 1;
result = result < subLength ? result : subLength;
break;
}
}
}
return result == INT32_MAX ? 0 : result;
}
};
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int subLength = 0, resLength = INT_MAX, i = 0, sum = 0;
for (int j = 0; j < nums.size(); j++) {
sum += nums[j];
while (sum >= target) {
subLength = (j - i + 1);
resLength = resLength > subLength ? subLength : resLength;
sum -= nums[i++];
}
}
return resLength == INT_MAX ? 0 : resLength;
}
};
-
- 二维数组初始化:vector<vector >vec(row,vector(col,‘#’));
- 区间不变性
- 变量的生命周期
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n, vector<int>(n, 0));
int startx = 0, starty = 0, offset = 1, count = 1;
int i = 0, j = 0;
int loop = n / 2;
int mid = n / 2;
while (loop --) {
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) res[mid][mid] = count;
return res;
}
};