摘要：
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), rig 阅读全文
posted @ 2021-08-15 15:49
三一一一317
阅读(47)
评论(0)
推荐(0)
摘要：
class Solution { public: static bool cmp(vector<int> &a, vector<int> &b){ // if(a[0]!=b[0]) return a[0]<b[0]; // else // return a[1]<b[1]; } vector<ve 阅读全文
posted @ 2021-08-15 14:53
三一一一317
阅读(71)
评论(0)
推荐(0)
摘要：
class Solution { public: int longestOnes(vector<int>& nums, int k) { unordered_map<int,int> un_map; int sum = 0; int i = 0; int j = 0; for(j = 0; j < 阅读全文
posted @ 2021-08-15 14:20
三一一一317
阅读(43)
评论(0)
推荐(0)
摘要：
class Solution { public: vector<vector<int>> findContinuousSequence(int target) { int n = target/2; int i = 1; int j = 1; int sum = 0; vector<vector<i 阅读全文
posted @ 2021-08-15 13:11
三一一一317
阅读(35)
评论(0)
推荐(0)
摘要：
// /** // * Definition for a binary tree node. // * struct TreeNode { // * int val; // * TreeNode *left; // * TreeNode *right; // * TreeNode() : val(0 阅读全文
posted @ 2021-08-15 12:35
三一一一317
阅读(75)
评论(0)
推荐(0)
摘要：
解析： https://www.cnblogs.com/gzshan/p/10904273.html?ivk_sa=1024320u class Solution { public: vector<int> maxSlidingWindow(vector<int>& nums, int k) { d 阅读全文
posted @ 2021-08-15 12:13
三一一一317
阅读(90)
评论(0)
推荐(0)
浙公网安备 33010602011771号