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

    public class Solution {
        public ListNode reverseKGroup(ListNode head, int k) {
            ListNode root = head;
            while(root!=null){
                ListNode temp = root;
                ListNode tempRoot = root;
                int i=k;
                i--;
                while(i!=0&&k>0&&temp!=null){
                    temp=temp.next;
                    i--;
                }
                if(temp==null){
                    return head;
                }else{
                    root = temp.next;
                    int j=k;
                    while(j!=0&&j>0){
                        ResK(tempRoot,j-1);
                        tempRoot=tempRoot.next;
                        j=j-2;
                    }
                }
                
            }
            return head;
            
        }
    
        private void ResK(ListNode head, int swap) {
            ListNode temp = head;
            while(swap!=0){
                swap--;
                temp=temp.next;        
            }
            int tt = temp.val;
            temp.val=head.val;
            head.val=tt;
                
            
        }
    }
  • 相关阅读:
    学习Easyui
    JS链表
    Javascript数组
    布局管理器(转)
    JCombobox组合框效果实现(转)
    JComboBox
    java.lang.ClassFormatError
    JSplitPane demo
    USB OTG简单介绍
    Cookie/Session机制具体解释
  • 原文地址:https://www.cnblogs.com/yixianyixian/p/3721853.html
Copyright © 2011-2022 走看看