zoukankan      html  css  js  c++  java
  • leetcode:Reverse Nodes in k-Group

    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
    分析
    从头节点到尾节点,依次翻转K个节点,翻转K个节点时,记录K个翻转后节点的头节点指针和尾节点指针。


    C++代码

    class Solution {
    public:
        ListNode* reverseKGroup(ListNode* head, int k) {
            ListNode*p,*q1=head,*lastNode=head,*q2,*last;
            if (!head||k==0)
                return head;
            q2 = nodeAfterKNodes(q1, k);
            head = reverseList(q1, k, last);
            lastNode = last;
            q1 = q2;
            while (q1){ 
                q2 = nodeAfterKNodes(q1, k);
                lastNode->next= reverseList(q1, k, last);
                lastNode = last;
                q1 = q2;
            }
            return head;
        }
        ListNode* reverseList(ListNode* head,int k,ListNode*& last){
            if (!head || k > length(head)){
                last = head;
                return head;
            }   
            ListNode* p = head, *q=NULL, *r=NULL;
            last = head;
            p = head;
            q = head->next;
            head->next = NULL;
            if (q)
                r = q->next;
            int i = 0;
            while (q && i<k-1){
                q->next = p;
                p = q;
                q = r;
                if (r)
                    r = r->next;
                i++;
            }
            return p;
        }
        int length(ListNode* head){
            int len = 0;
            while (head){
                len++;
                head = head->next;
            }
            return len;
        }
        ListNode* nodeAfterKNodes(ListNode* head, int k){
            if (k > length(head))
                return NULL;
            int i = 0;
            while (i < k){
                head = head->next;
                i++;
            }
            return head;
        }
    };
  • 相关阅读:
    Java学习笔记(一)语法
    【转,整理】C# 非托管代码
    HTML5学习笔记(七)WebSocket
    HTML5学习笔记(七)HTML5 服务器发送事件(Server-Sent Events)
    MySQL修改表格内容3
    MySQL修改表格内容2
    MySQL修改表格内容
    MySQL创建表格
    if-else if-else;多选择结构
    面向对象和面向过程的初步概念
  • 原文地址:https://www.cnblogs.com/yutingliuyl/p/6994457.html
Copyright © 2011-2022 走看看