奶ve

分类

/ 注册

全部文章（共61篇）

题解 | #合并区间#

/** * struct Interval { * int start; * int end; * Interval(int s, int e) : start(start), end(e) {} * }; */ class Solution { public: /**...

2024-05-06

0 152

题解 | #牛群分隔#

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

2024-05-06

0 190

题解 | #牛牛的递增之旅#

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

2024-05-06

0 161

题解 | #牛牛的冒险旅程#

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

2024-05-06

0 196

题解 | #设计LRU缓存结构#

class Solution { private: int capacity; // 双向链表存储键值对，保持访问顺序，O(1) 时间插入删除 // int key, int value list<pair<int, int>> items; ...

2024-05-04

0 184

题解 | #旋转链表#

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

2024-05-04

0 168

题解 | #反转链表#

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

2024-05-03

0 153

题解 | #合并两个排序的链表#

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

2024-05-03

0 164

题解 | #合并k个已排序的链表#

/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ #include <queue> struct ...

2024-05-03

0 153

题解 | #删除有序链表中重复的元素-II#

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

2024-05-03

0 131