![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
每日两题
柴可拉夫斯基
这个作者很懒,什么都没留下…
展开
-
2021.3.19
螺旋矩阵 II class Solution { public: vector<vector<int>> generateMatrix(int n) { vector<vector<int>> ans(n, vector<int>(n)); if (n == 0) return ans; int num = 1; int l = 0; int u = 0; int d = n - 1; int r = n - 1; wh.原创 2021-03-19 21:47:53 · 83 阅读 · 0 评论 -
2021.3.18做题记录
螺旋矩阵 class Solution { public: vector<int> spiralOrder(vector<vector<int>>& matrix) { vector <int> ans; if(matrix.empty()) return ans; //若数组为空,直接返回答案 int u = 0; //赋值上下左右边界 int d = matrix.size.原创 2021-03-18 15:56:02 · 72 阅读 · 0 评论 -
2021.3.17做题记录
甲板上的战舰 class Solution { public: int countBattleships(vector<vector<char>>& board) { int R = board.size(), C = board[0].size(), res = 0; for (int i = 0; i < R; ++i) for (int j = 0; j < C; ++j) .原创 2021-03-17 20:59:07 · 62 阅读 · 1 评论 -
2021.3.15做题记录
图片平滑器 class Solution { public: vector<vector<int>> imageSmoother(vector<vector<int>>& M) { int m = M.size(), n = M.front().size(); vector<vector<int>> result(m, vector<int>(n)); fo.原创 2021-03-16 21:41:32 · 65 阅读 · 0 评论 -
2021.3.16做题记录
119.杨辉三角2 class Solution { public: vector<int> getRow(int rowIndex) { vector<int> res(rowIndex + 1) ; res[0] = 1 ; for ( int i = 1 ; i < rowIndex + 1 ; i ++ ) { for ( int j = i ; j > 0 ; j --原创 2021-03-16 21:39:15 · 47 阅读 · 0 评论 -
2021.3.8做题记录
三个数的最大乘积 class Solution { public: int maximumProduct(vector<int>& nums) { sort(nums.begin(), nums.end()); int n = nums.size(); return max(nums[0] * nums[1] * nums[n - 1], nums[n - 3] * nums[n - 2] * nums[n - 1]); } }; .原创 2021-03-09 20:21:57 · 67 阅读 · 0 评论 -
2021..3.9做题记录
665.非递减数列 class Solution { public: bool checkPossibility(vector<int>& nums) { int count=0;//记录非递增数个数 for (int i = 1; i < nums.size(); i++) { //根据总结的规律分类 if(nums[i]<nums[i-1]){ if (i == 1 || nums[i] >= nums[i - 2]) {原创 2021-03-09 20:17:04 · 69 阅读 · 0 评论 -
2021.3.6做题记录
第三大的数 class Solution { public: int thirdMax(vector<int>& nums) { long long Max = -3e9, secondMax = -3e9, thirdMax = -3e9; for (int i = 0; i < nums.size(); i++) { if (nums[i] > Max) { thirdMax = secondMax; secondMax = Max;.原创 2021-03-06 20:37:38 · 75 阅读 · 0 评论