码迷,mamicode.com
首页 > 其他好文 > 详细

【LeetCode】Reverse Nodes in k-Group

时间:2014-05-11 18:15:52      阅读:300      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   class   code   java   

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

bubuko.com,布布扣
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;
            
        
    }
}
bubuko.com,布布扣

 

【LeetCode】Reverse Nodes in k-Group,布布扣,bubuko.com

【LeetCode】Reverse Nodes in k-Group

标签:des   style   blog   class   code   java   

原文地址:http://www.cnblogs.com/yixianyixian/p/3721853.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!