![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Leetcode题目
Axe涛
爱学习,爱分享!
展开
-
LeetCode:1382. 将二叉搜索树变平衡(C++带详细注释)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int>mid;//存中序序列原创 2020-10-16 15:47:06 · 268 阅读 · 0 评论 -
Leetcode;200. 岛屿数量(DFS+BFS算法 C++带详细注释)
Leetcode;200. 岛屿数量(DFS算法 C++带详细注释)class Solution {public:// void dfs(vector<vector<char>>& grid,int i, int j)//DFS遍历函数// { int row=grid.size();//矩阵行数// int col=grid[0].size();//矩阵列数// if(i<0||i>=row||j&原创 2020-10-12 15:12:38 · 328 阅读 · 0 评论 -
LeetCode:94. 二叉树的中序遍历(递归和迭代两种方法)
LeetCode:94. 二叉树的中序遍历(递归和迭代两种方法)/** * 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), lef原创 2020-10-12 09:29:43 · 129 阅读 · 0 评论 -
LeetCode:445. 两数相加 II(C++带详细注释)
LeetCode:445. 两数相加 II(C++带详细注释)/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* addTwoNumbers(ListNode* l1原创 2020-10-12 09:25:34 · 117 阅读 · 0 评论 -
LeetCode:1484. 克隆含随机指针的二叉树(方法1:hash_map+DFS 方法2:两次DFS ,C++带详细注释)
LeetCode:1484. 克隆含随机指针的二叉树(方法1:hash_map+DFS 方法2:两次DFS, C++带详细注释)/** * Definition for a binary tree node. * struct Node { * int val; * Node *left; * Node *right; * Node *random; * Node() : val(0), left(nullptr), right(nullptr), r原创 2020-10-12 09:22:27 · 194 阅读 · 0 评论 -
LeetCode:199. 二叉树的右视图(C++带详细注释)
LeetCode:199. 二叉树的右视图(C++带详细注释)/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:原创 2020-10-12 09:18:34 · 195 阅读 · 0 评论 -
LeetCode:面试题 02.05. 链表求和(C++带详细注释)
LeetCode:面试题 02.05. 链表求和(C++带详细注释)/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* addTwoNumbers(ListNode*原创 2020-10-12 09:15:31 · 161 阅读 · 0 评论 -
LeetCode:145. 二叉树的后序遍历(迭代和递归方法,C++带详细注释)
LeetCode:145. 二叉树的后序遍历(迭代和递归方法,C++带详细注释)/** * 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原创 2020-10-12 09:06:00 · 73 阅读 · 0 评论 -
LeetCode:143. 重排链表(C++带详细注释)
LeetCode:143. 重排链表(C++带详细注释)/** * 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, ListNod原创 2020-10-11 16:33:44 · 263 阅读 · 0 评论 -
LeetCode:142. 环形链表 II(哈希表和快慢指针(龟兔赛跑)法 C++带详细注释)
LeetCode:142. 环形链表 II(哈希表和快慢指针(龟兔赛跑)法 C++带详细注释)/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *detectCycl原创 2020-10-11 16:31:12 · 129 阅读 · 0 评论 -
LeetCode:98. 验证二叉搜索树(C++带详细注释)
LeetCode:98. 验证二叉搜索树(C++带详细注释)/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:vect原创 2020-10-11 16:23:22 · 151 阅读 · 0 评论 -
LeetCode:92. 反转链表 II(C++带详细注释)
LeetCode:92. 反转链表 II(C++带详细注释)/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* reverseBetween(ListNode* he原创 2020-10-11 16:20:00 · 175 阅读 · 0 评论 -
LeetCode:18. 四数之和(C++带详细注释)
LeetCode:18. 四数之和(C++带详细注释)class Solution {public: vector<vector<int>> fourSum(vector<int>& nums, int target) { vector<vector<int>>res;//预定义结果数组 int len=nums.size();//获取数组长度; sort(nums.begin()原创 2020-10-11 16:17:58 · 345 阅读 · 0 评论 -
Leetcode:2. 两数相加(C++带详细注释)
Leetcode:2. 两数相加(C++带详细注释)/** * 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原创 2020-10-11 16:15:01 · 342 阅读 · 0 评论 -
Leetcode:25. K 个一组翻转链表(C++带详细注释)
Leetcode:25. K 个一组翻转链表(C++带详细注释)/** * 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, Lis原创 2020-10-11 16:09:19 · 164 阅读 · 0 评论 -
Leetcode:23. 合并K个升序链表 (C++带详细注释)
Leetcode:23. 合并K个升序链表 (C++带详细注释)/** * 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, Lis原创 2020-10-11 16:03:51 · 361 阅读 · 0 评论 -
Leetcodde:1371. 每个元音包含偶数次的最长子字符串,C++带详细注释
Leetcodde:1371. 每个元音包含偶数次的最长子字符串,C++带详细注释class Solution {public: int findTheLongestSubstring(string s) { vector<int>pos(32,INT_MAX);//32个状态(0-31),数组值记录每个状态出现的位置 int ans=0;//最大子串长度 int status=0;//状态值0-31(5位二进制)1为奇0为偶原创 2020-10-11 15:57:50 · 211 阅读 · 1 评论 -
leetcode 面试题16.18.模式匹配:复现双百算法(分类别讨论),C++带详细注解
leetcode 面试题16.18.模式匹配:复现双百算法(分类别讨论),C++带详细注解分成5类讨论,定义了两个辅助函数:class Solution {public:bool kSegment(string value,int k)//判断value能否被分成k个一样的字串{ int len=value.size();//求value长度 if(len%k!=0) return false;//长度不是k的整数倍,不能 int m=len/k;//求k等分后每个字符串的原创 2020-10-11 15:47:44 · 204 阅读 · 1 评论