刷题
BUAA_小胡
这个作者很懒,什么都没留下…
展开
-
剑指 Offer 13. 机器人的运动范围
class Solution {public: int help(int i){ int sum=0; while(i!=0){ sum+=i%10; i=i/10; } return sum; } int movingCount(int m, int n, int k) { vector<vector<int>> dp(m,ve.原创 2022-03-04 09:06:27 · 74 阅读 · 0 评论 -
222. 完全二叉树的节点个数
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *.原创 2022-01-25 08:22:32 · 483 阅读 · 0 评论 -
223. 矩形面积
class Solution {public: int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) { int A1=(ax2-ax1)*(ay2-ay1); int A2=(bx2-bx1)*(by2-by1); int U = max(0,min(ax2,bx2)-max(ax1,bx1))*max(0,min(ay2,b.原创 2022-01-24 22:21:32 · 78 阅读 · 0 评论 -
209. 长度最小的子数组
class Solution {public: int minSubArrayLen(int target, vector<int>& nums) { queue<int> Q; int sum=0; int ans=nums.size()+1; for(auto num:nums){ sum+=num; Q.push(num); .原创 2022-01-24 22:15:23 · 60 阅读 · 0 评论 -
97. 交错字符串
class Solution {public: bool isInterleave(string s1, string s2, string s3) { if(s1=="") return s2==s3; if(s2=="") return s1==s3; int n=s1.size(); int m=s2.size(); if(s3.size()!=(m+n)) .原创 2022-01-22 16:08:33 · 272 阅读 · 0 评论 -
117. 填充每个节点的下一个右侧节点指针 II
/*// Definition for a Node.class Node {public: int val; Node* left; Node* right; Node* next; Node() : val(0), left(NULL), right(NULL), next(NULL) {} Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {} Node(.原创 2022-01-22 16:07:47 · 56 阅读 · 0 评论 -
199. 二叉树的右视图
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *.原创 2022-01-22 16:06:43 · 66 阅读 · 0 评论 -
143. 重排链表
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) : val(x), next(next.原创 2022-01-22 16:05:36 · 230 阅读 · 0 评论 -
5. 最长回文子串
class Solution {public: string longestPalindrome(string s) { int n = s.size(); vector<vector<int>> dp(n,vector<int>(n,0)); for(int i=0;i<n;i++){ dp[i][i]=true; } for (int L = 2;.原创 2022-01-19 09:09:39 · 270 阅读 · 0 评论 -
163. 缺失的区间
class Solution {public: vector<string> findMissingRanges(vector<int>& nums, int lower, int upper) { vector<string> ans; for(auto num:nums){ if(lower==num){ lower+=1; co.原创 2022-01-17 10:04:17 · 328 阅读 · 0 评论 -
157. 用 Read4 读取 N 个字符
/** * The read4 API is defined in the parent class Reader4. * int read4(char *buf4); */class Solution {public: /** * @param buf Destination buffer * @param n Number of characters to read * @return The number of actual cha.原创 2022-01-16 21:05:02 · 208 阅读 · 0 评论 -
156. 上下翻转二叉树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *.原创 2022-01-16 20:44:34 · 178 阅读 · 0 评论 -
LeetCode-树的构造篇
树的创建一定是递归创建,分而治之的1.LeetCode108,将有序数组转换为二叉搜索树对于该题一个比较朴素的想法就是讲每棵树的左右子树的节点数量差控制在一个节点范围内,即每次将数组arr分成(arr-1)/2和arr-(arr-1)/2-1两个子树,然后数组中间节点作为根节点def build(arr[],l,r): if l>r: return None mid=l+(r-...原创 2020-04-26 21:58:05 · 578 阅读 · 0 评论