zoukankan      html  css  js  c++  java
  • LeetCode_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 *reverseKGroup(ListNode *head, int k) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
            if(k <= 0 || head == NULL) return  head;
            int len = 0, tempK;
            ListNode *p, *cur,*q , *pre ,*tail;
            
            q = head;
            while(q){  
                len++;
                q = q->next;
            }
            if(len < k) return head;
            
            cur = head;
            pre = NULL;
            while(len >= k){
                
                tempK = 0; p = NULL;
                while( tempK < k){
                    if(p == NULL){
                      p = cur;
                      tail = cur;
                      cur = cur->next;
                    }else{
                      q = cur->next;
                      cur->next = p;
                      p = cur;
                      cur = q;
                    }
                    tempK++;
                }
                
                if(pre == NULL)
                    head = p;        
                else
                    pre ->next = p;
                pre = tail;
                pre->next = cur;
                len = len - k;
           }
           
            return head;
        }
    };
  • 相关阅读:
    Java自学-I/O File类
    Java自学-异常处理 自定义异常
    Java自学-异常处理 Throwable
    Java自学-异常处理 异常分类
    Java自学-异常处理 处理
    Java自学-异常处理 Exception
    Java自学-日期 Calendar
    Java自学-日期 日期格式化
    Java自学-日期 Date
    Java自学-数字与字符串 MyStringBuffer
  • 原文地址:https://www.cnblogs.com/graph/p/3260913.html
Copyright © 2011-2022 走看看