夜深人静写bug

分类

题解(1)

/ 注册

全部文章（共33篇）

题解 | #链表相加(二)#

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

2023-09-07

0 241

题解 | #链表相加(二)#

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

2023-09-07

0 220

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

class Solution { public: ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) { if(!pHead1 || !pHead2) return nullptr; int...

2023-09-06

0 148

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

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

2023-09-02

0 245

题解 | #链表中倒数最后k个结点#

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

2023-09-02

0 229

题解 | #判断链表中是否有环#

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} ...

2023-08-31

0 182

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

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

2023-08-31

0 255

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

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

2023-08-30

0 225

题解 | #链表中的节点每k个一组翻转#

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

2023-08-29

0 269

题解 | #链表内指定区间反转#

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

2023-08-28

0 289