牛客861440576号

分类

/ 注册

全部文章（共48篇）

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

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

2026-01-11

0 20

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

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

2026-01-11

0 17

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

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

2026-01-11

0 14

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

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

2026-01-10

0 22

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

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

2026-01-10

0 19

题解 | 合并两个排序的链表-遍历版

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

2026-01-10

0 17

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

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

2026-01-10

0 18

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

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

2026-01-10

0 20

题解 | 反转链表

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

2026-01-10

0 17

题解 | #谁是你的潜在朋友#

// // Created by yang on 2023/5/23. // #include "cstdio" using namespace std; int main(){ int N, M, books[201] = {0}; books[0] = -1; sca...

2023-05-23

0 298