977.有序数组的平方
虽然提示了双指针,但还是没想出。
看题解后代码如下:
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
vector<int> result(nums.size(),0);;
int i = 0;
int numLen = nums.size() - 1 ;
int resultLen = numLen;
while(i <= numLen)
{
if(nums[i]*nums[i] < nums[numLen]*nums[numLen])
{
result[resultLen--] = nums[numLen] * nums[numLen];
numLen--;
}
else
{
result[resultLen--] = nums[i] * nums[i];
i++;
}
}
return result;
}
};
不足:cpp还没学到容器,写result的时候报了不少错。
209.长度最小的子数组
只想到了暴力,还是看了题解照着写的,while循环很巧妙,且题解的移动尾指针的思路很有帮助。学了下INT32_MAX和INT32_MIN;
代码如下:
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int result = INT32_MAX;
int sum = 0;
int i = 0;
int length = 0;
for(int j = 0; j < nums.size();j++){
sum += nums[j];
while(sum >= target){
length = j - i + 1;
result = result < length? result : length;
sum -= nums[i++];
}
}
return result == INT32_MAX ? 0 : result;
}
};
59.螺旋矩阵Ⅱ
看了题解还是有点绕
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> matrix(n, vector<int>(n,0));
int startX = 0;
int startY = 0;
int setNum = 1;
int offset = 1;
int loop = n / 2;
int middle = n / 2;
int i, j;
while(loop--)
{
i = startX;
j = startY;
for(i; i < n - offset; i++)
{
matrix[j][i] = setNum++;
}
for(j; j < n - offset; j++)
{
matrix[j][i] = setNum++;
}
for(; i > startX; i--)
{
matrix[j][i] = setNum++;
}
for(; j > startY; j--)
{
matrix[j][i] = setNum++;
}
startX++;
startY++;
offset++ ;
}
if(n % 2)
{
matrix[middle][middle] = setNum;
}
return matrix;
}
};