977.有序数组的平方
题目:
方法一:直接用sort函数(好懂不解释)
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int size = nums.size();
vector<int> answer;
for (int i=0; i<size; i++) {
answer.push_back(nums[i]*nums[i]);
}
sort(answer.begin(), answer.end());
return answer;
}
};
方法二:双指针(中间开花)
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int size = nums.size();
int neg = -1;
for (int i=0; i<size; i++) {
if (nums[i] < 0) {
neg = i;
} else {
break;
}
}
vector<int> answer;
int x = neg, y = neg + 1;
while (x >= 0 || y < size) {
//cout << size << endl;
if (x < 0) {
answer.push_back(nums[y] * nums[y]);
++y;
//cout << "1" << endl; (用于debug)
}
else if (y == size) { //一开始写成了(y = size),下次小心
answer.push_back(nums[x] * nums[x]);
--x;
//cout << "2" << endl;
}
else if (nums[x] * nums[x] >= nums[y] * nums[y]) {
answer.push_back(nums[y] * nums[y]);
++y;
//cout << "3" << endl;
}
else {
answer.push_back(nums[x] * nums[x]);
--x;
//cout << "4" << endl;
}
}
return answer;
}
};
for loop里的i++和i--好像都可以,但是不知道原因,待解决。
方法三:双指针(两边开花,妙!)
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int size = nums.size();
vector<int> answer(size); //(size)一定要加,不然会出错
for ( int i=0, j=size-1, pos=size-1; i<=j; ) { //一开始写成了 i<j
if ( nums[i] * nums[i] <= nums[j] *nums[j]) {
answer[pos] = nums[j] * nums[j];
--j;
}
else {
answer[pos] = nums[i] * nums[i];
++i;
}
--pos;
}
return answer;
}
};
209.长度最小的子数组
题目:
方法一:暴力法
18/20,两个没过,而且还超时了。
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int size = nums.size();
int s_len = size, total_sum=0;
for (int i=0; i<size; i++) {
int sum = 0;
total_sum += nums[i];
for (int j=i; j<size; j++) {
sum += nums[j];
if (sum >= target && ((j-i+1)<s_len) ) {
s_len = j - i + 1;
}
}
}
if (total_sum < target) {
return 0;
}
return s_len;
}
};
方法二:滑动窗口(妙!)
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int size = nums.size();
int result = INT32_MAX;
int sub_len;
int sum = 0;
int left = 0;
for (int i=0; i<size; i++) {
sum += nums[i];
while (sum >= target) {
sub_len = i - left + 1;
result = sub_len < result ? sub_len : result;
sum -= nums[left];
left++; //两行可以以合起来:sum -= nums[left++];
}
}
return result == INT32_MAX ? 0 : result;
}
};
59.螺旋矩阵II
题目:
暴力破解,自己写的代码,重点是要坚持 左闭右开。
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> matrix(n, vector<int>(n));
int loop = n/2;
int count = 1;
for (int i=0; i<loop; i++ ) {
int num = n - 1 - (2 * i); // the number of numbers in each loop
// upper
for (int j=0; j<num; j++) {
matrix[i][i + j] = count++;
}
// right
for (int j=0; j<num; j++) {
matrix[i + j][n - i - 1] = count++;
}
// lower
for (int j=n-i-1; j>n-i-1-num; j--) {
matrix[n - 1 -i][j] = count++;
}
// left
for (int j=n-i-1; j>n-i-1-num; j--) {
matrix[j][i] = count++;
}
}
if (n % 2 == 1) { // if n is odd, the center = n*n
matrix[n / 2][n / 2] = n * n;
}
return matrix;
}
};