题目:
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 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
思考:
开始看到本题是关于链表的操作,我下意识地去交换节点之间的位置,但是这种操作使得复杂度很高,并且根据编译器不同,有时候不允许指针赋值为NULL;我在本地VS上编译的程序,放到leetcode上会报不允许赋值为NULL的错误。因此后来我选择了不动node的位置,而是改变node中的数字,这样的操作会减小。
本题使用stack去辅助操作,使用两个标记指针去遍历链表;开始的时候标记指针A,B都指向头结点,然后标记指针B先动,往后遍历K个节点,并且把遍历到的数字都压到栈里面,然后到A指针动K个节点,并且修改节点中的数字为stack出栈的数字;重复这样B->A的操作,遍历完整个链表,如果标记指针B遍历不够K个节点,则指针A不需要动。
代码:
using namespace std;
#include<stack>
class Solution {
public:
ListNode* reverseKGroup(ListNode* head, int k) {
if (k <= 1 || head == NULL){
return head;
}
ListNode* record_head, *check_point;
record_head = check_point = head;
stack<int> num;
while (check_point != NULL){
num.push(check_point->val);
check_point = check_point->next;
if (num.size() >= k){
while (record_head != NULL && num.size()> 0){
record_head->val = num.top();
num.pop();
record_head = record_head->next;
}
}
}
return head;
}
};
结果: