![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
List
文章平均质量分 52
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Partition List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *pa原创 2013-01-24 20:39:18 · 328 阅读 · 0 评论 -
[LeetCode] Reverse Linked List II
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *re原创 2013-01-24 19:23:47 · 384 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted List II
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *de原创 2013-01-25 02:39:23 · 390 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *de原创 2013-01-25 02:42:52 · 392 阅读 · 0 评论 -
[LeetCode] Merge Two Sorted Lists
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *me原创 2013-01-27 20:49:33 · 312 阅读 · 0 评论 -
[LeetCode] Rotate List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ro原创 2013-01-27 21:43:29 · 346 阅读 · 0 评论 -
[LeetCode] Swap Nodes in Pairs
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *sw原创 2013-01-28 17:59:43 · 363 阅读 · 0 评论 -
[LeetCode] Remove Nth Node From End of List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *re原创 2013-01-28 18:26:49 · 343 阅读 · 0 评论 -
[LeetCode] Add Two Numbers
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ad原创 2013-01-29 10:04:53 · 451 阅读 · 0 评论