2017年7月1日
双指针
摘要： #include #include using namespace std; ///Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; /// LinkedList Test... 阅读全文
posted @ 2017-07-01 22:00 czcColud 阅读(125) 评论(0) 推荐(0) 编辑
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of
摘要： class Solution { public: ListNode *reverseKGroup(ListNode *head, int k) { if (!head || !(head->next) || k next; else return head; // rev... 阅读全文
posted @ 2017-07-01 19:25 czcColud 阅读(249) 评论(0) 推荐(0) 编辑