打卡第二天,麻烦各位读者给我点赞加关注,帮我加油打气!
一、977. (有序数组的平方):
题目如下:
class Solution
{
public:
vector<int> sortedSquares(vector<int>& nums)
{
int k = nums.size() - 1;
vector<int>result(nums.size(), 0);
for (int i = 0, j = nums.size() - 1; 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;
}
};
二、209题.(长度最小的子数组)
题目如下:
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int i=0;
int sum=0;
int result=INT32_MAX;
int length=0;
for(int j=0;j<=nums.size()-1;j++)
{
sum+=nums[j];
while(sum>=target)
{
length=j-i+1;
result=min(result,length);
sum=sum-nums[i];
++i;
}
}
return result==INT32_MAX?0:result;
}
};