Hard-题目14:25. Reverse Nodes in k-Group

原创 2016年05月31日 23:30:42

题目原文:
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
题目大意:
给出一个链表,要求k个一组地进行翻转,如果数组长度不是k的倍数,则最后一组不用翻转。要求使用常数的空间复杂度。
题目分析:
使用双指针,分别指向头结点(记为p1)和头结点后第k个节点(记为p2,如果长度不足k,则直接返回头结点),翻转p1-p2的部分(又是一个双指针),然后递归翻转p2以后的部分。
源码:(language:cpp)

class Solution {
public:
    ListNode *reverseKGroup(ListNode *head, int k) {
        if (!head || !(head->next) || k < 2)
            return head;

        // count k nodes
        ListNode *nextgp = head;
        for (int i = 0; i < k; i++)
            if (nextgp)
                nextgp = nextgp->next;
            else
                return head;

        // reverse
        ListNode *prev = NULL, *cur = head, *next = NULL;
        while (cur != nextgp) {
            next = cur->next;
            if (prev)
                cur->next = prev;
            else
                cur->next = reverseKGroup(nextgp, k);
            prev = cur;
            cur = next;
        }
        return prev;
    }
};

成绩:
24ms,beats 41.82%,众数24ms,58.05%
Cmershen的碎碎念:
本题非常考验链表指针的细节操作,稍有不慎链表后面的信息就丢失了。

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

Leetcode 25. Reverse Nodes in k-Group (Hard) (cpp)

Leetcode 25. Reverse Nodes in k-Group (Hard) (cpp)
  • Niko_Ke
  • Niko_Ke
  • 2016年12月10日 04:04
  • 166

25. Reverse Nodes in k-Group[hard]

题目: Given a linked list, reverse the nodes of a linked list k at a time and return its modified l...

Leetcode之Reverse Nodes in k-Group (Hard)

Leetcode之Reverse Nodes in k-Group解法分析

算法设计与分析(18)-- Reverse Nodes in k-Group(难度:Hard)

Reverse Nodes in k-Group

LeetCode 25: 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. I...

LeetCoder 25. Reverse Nodes in k-Group

题意将一个链表每隔k个结点反转一次,例如:1->2->3->4->5->6,k = 3反转后为3->2->1->6->5->4当不够k个的时候,不用反转思路根据类似于反转整条链表的思路,将kk个结点作...

leetcode_25_Reverse Nodes in k-Group

思路: 大概思路就是找出K个结点的起始位置和并将这K 个结点采用头插法的方式依次插入到这K个结点开始位置的前面一个位置之后,就可以了。 思路倒是很简单,但是指针所指的位置的捉摸是有点麻烦的,还有就是...

LeetCode OJ | #25 Reverse Nodes in k-Group

考试前刷一波leetcode。 这次的问题依然是简单的,但是处理方式极为麻烦,因为涉及到了单向链表的反转操作。C++有个规律:一旦涉及到指针和链表的东西,绝对会有无数的边界情况和细节在等着你。 先上题...

LeetCode 25 reverse-nodes-in-k-group

解决这题之前,先看看这一题: Reverse  a linked list from position m to n. Do it in-place and in one-pass. For exa...

leetcode25~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.k i...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Hard-题目14:25. Reverse Nodes in k-Group
举报原因:
原因补充:

(最多只允许输入30个字)