leetcode算法训练打卡day2--数组

977. 有序数组的平方

 //采用双指针进行更新操作
  vector<int> sortedSquares(vector<int>& nums) {
      int n = nums.size();
      //存放更新完的数组
      vector<int> ans(n, 0);
      int k = n-1;
      for (int i = 0, j = n-1; i <= j;) {
          if (nums[i]*nums[i] < nums[j]*nums[j]) {
              ans[k--] = nums[j]*nums[j];
              j--;
          }else{
              ans[k--] = nums[i]*nums[i];
              i++;
          }
      }
      return ans;

  }

209. 长度最小的子数组

int minSubArrayLen(int target, vector<int>& nums) {
    int n = nums.size();
    int minlen = INT32_MAX; //通过这个可以判断数组长度是否有被赋值
    int i = 0; //记录起点
    int sum = 0;//区间内数据的总和
    int substrlen = 0;//子区间的长度
    //i表示的是终点，每次循环移动起点得到sum>=target最小长度
    for (int j = 0; j < n; j++) {
        sum += nums[j];
        while (sum >= target) {
            substrlen = j-i+1;
            minlen = min(minlen, substrlen);
            sum -= nums[i++];
        }
    }
    //查看result是否有赋值,如果没有返回0
    return minlen == INT32_MAX ? 0 : minlen;
}

59. 螺旋矩阵 II

  vector<vector<int>> generateMatrix(int n) {
      vector<vector<int>> ans(n, vector<int>(n,0));
      int k = 1;
      int left = 0, right = n-1, up = 0, down = n-1;
      //顺时针旋转
      while(1){
          //向右
          for (int i = left; i <= right; i++) ans[up][i] = k++;
          if (++up > down) break;
          //向下
          for (int i = up; i <= down; i++) ans[i][right] = k++;
          if (--right < left) break;

          //向左
          for (int i = right; i >= left; --i) ans[down][i] = k++;
          if (--down < up) break;

          //向上
          for (int i = down; i >= up; --i) ans[i][left] = k++;
          if (++left > right) break;
      }
      return ans;
  }