LeetCode OJ:Reverse Nodes in k-Group
2014-01-30 21:24
357 查看
Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
You may not alter the values in the nodes, only nodes itself may be changed.
Only constant memory is allowed.
For example,
Given this linked list:
1->2->3->4->5
For k = 2, you should return:
2->1->4->3->5
For k = 3, you should return:
3->2->1->4->5
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* reverse(ListNode *pre, ListNode *next){ ListNode *last = pre->next; ListNode *cur = last->next; while(cur != next){ last->next = cur->next; cur->next = pre->next; pre->next = cur; cur = last->next; } return last; } ListNode *reverseKGroup(ListNode *head, int k) { ListNode *nh = new ListNode(0); nh->next = head; ListNode *pre = nh; int count = 0; while(head){ count++; if(count % k ==0){ pre = reverse(pre, head->next); head = pre->next; }else { head = head->next; } } return nh->next; } };
相关文章推荐
- LeetCode OJ--Reverse Nodes in k-Group **
- LeetCode OJ | #25 Reverse Nodes in k-Group
- LeetCode OJ - Reverse Nodes in k-Group
- LeetCode OJ:Reverse Nodes in k-Group(K个K个的分割节点)
- [LeetCode] Reverse Nodes in k-Group
- [LeetCode]Reverse Nodes in k-Group
- leetcode -- Reverse Nodes in k-Group -- 经典题目,要重写
- Leetcode: Reverse Nodes in k-Group
- Reverse Nodes in k-Group
- [LeetCode] Reverse Nodes in k-Group
- Reverse Nodes in k-Group
- [leedcode 25] Reverse Nodes in k-Group
- LeetCode进阶之路(Reverse Nodes in k-Group)
- [LeetCode][Java] Reverse Nodes in k-Group
- leetcode 025 —— Reverse Nodes in k-Group
- leetcode | Reverse Nodes in k-Group
- [leetcode 25]Reverse Nodes in k-Group
- LeetCode -- Reverse Nodes in k-Group
- LeetCode之Reverse Nodes in k-Group
- LeetCode - Reverse Nodes in k-Group