Dfine

分类

/ 注册

全部文章（共78篇）

题解 | 二叉树平衡检查

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

2025-07-01

0 24

题解 | 分条件出栈

#include <utility> #include <vector> class CatDogAsylum { void cleanup(vector<pair<int, bool>>& stacks) { vector<pa...

2025-07-01

0 20

题解 | 双栈排序

#include <cstdio> class TwoStacks { public: vector<int> twoStacksSort(vector<int> numbers) { // write code here ...

2025-07-01

0 24

题解 | 集合栈

#include <vector> class SetOfStacks { public: vector<vector<int> > setOfStacks(vector<vector<int> > ope, int size...

2025-07-01

0 25

题解 | 集合栈

#include <vector> class SetOfStacks { public: vector<vector<int> > setOfStacks(vector<vector<int> > ope, int size...

2025-07-01

0 28

题解 | 回文链表

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) {} };*/ #include <string> class Palindrome...

2025-07-01

0 31

题解 | 回文链表

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) {} };*/ #include <string> class Palindrome...

2025-07-01

0 23

题解 | 链式A+B

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

2025-07-01

0 26

题解 | 链式A+B

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

2025-07-01

0 25

题解 | 链表分割

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

2025-07-01

0 25