Quan_2022

题解

/ 注册

全部文章 / 题解（共29篇）

题解 | #包含min函数的栈#

class Solution { public: void push(int value) { stk1.push(value); // 小于等于stk2栈顶，同时将value压入 stk1和 stk2，空的时候也压入 stk2 if(stk...

C++

2021-09-22

0 402

题解 | #重建二叉树#

class Solution { public: TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) { if(pre.size()==0 || vin.size()==0)...

C++

2021-09-21

2 501

题解 | #数组中相加和为0的三元组#

class Solution { public: vector<vector<int> > threeSum(vector<int> &num) { int len = num.size(); if(len <...

C++

2021-09-21

0 350

题解 | #在二叉树中找到两个节点的最近公共祖先#

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: int lowestC...

C++

2021-09-21

4 472

题解 | #两个链表的第一个公共结点#

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } };*/ class Solution { public...

C++

2021-09-21

0 350

题解 | #最长公共子串#

class Solution { public: string LCS(string str1, string str2) { string res = ""; int len1 = str1.size(), len2 = str2.siz...

C++

2021-09-21

0 405

题解 | #按之字形顺序打印二叉树#

/* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(N...

C++

2021-09-20

5 486

题解 | #删除链表的倒数第n个节点#

快慢指针加虚拟头结点处理。注意处理链表长度为n的和小于n的情形。 class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode node(0); no...

C++

2021-09-20

0 378

题解 | #链表中环的入口结点#

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } }; */ class Solution { public: ...

C++

2021-09-20

0 377

题解 | #最长无重复子数组#

class Solution { public: int maxLength(vector<int>& arr) { int len = arr.size(); if(len<=1) return len; i...

C++

2021-09-19

0 397