leetcode25 Reverse Nodes in k-Group

原创 2015年11月18日 17:19:25

Reverse Nodes in k-Group

My Submissions
Total Accepted: 47206 Total Submissions: 181287 Difficulty: Hard

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.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public static ListNode reverse(ListNode p, int k) {
		ListNode pre = new ListNode(-1);
		ListNode px = p;
		ListNode q = px.next;
		for (int i = 0; i < k ; i++) {
			q = px.next;
			px.next = pre.next;
			pre.next = px;
			px = q;
		}
		return pre.next;
	}
    public ListNode reverseKGroup(ListNode head, int k) {
        if(head==null || head.next==null || k<1){
			return head;
		}
		ListNode pre = new ListNode(-1);
		ListNode startpre = pre;
	    ListNode p = head;
	    //ListNode prem = pre;
	    ListNode pm = p;
	   // boolean flag = false;
	    ListNode r = head;
	    int count = 0;
	    while(r!=null){
	    	r = r.next;
	    	count++;
	    }
	    if(count<k){
	    	return head;
	    }
	    while(true){
	    	int i;
	    	for( i=0;i<k && pm!=null;i++){
	    		//prem = pm;
	    		pm = pm.next;
	    	}
	    	/*if(pm==null && i<k &&flag == false){
	    		return head;
	    	}
	    	if(pm==null && i>=k && flag == false){
	    		ListNode x = reverse(p, k);
	    		pre.next = x;
	    	}*/
	    	if(i>=k ){
	    	//	flag = true;
	    		ListNode x = reverse(p, k);
	    		pre.next = x;
	    		/*pre = prem;*/
	    		for(int j=0;j<k;j++){
	    			pre = pre.next;
	    		}
	    		pre.next = pm;
	    		p = pm;
	    	}
	    	if(i<k){
	    		
	    		break;
	    	}
	    }
	    return startpre.next;
    }
}

可运行代码


package lianbiaofanzhuan;

public class Solution {
	public static ListNode create(int[] a) {
		ListNode head = new ListNode(a[0]);
		ListNode p = head;
		for (int i = 1; i < a.length; i++) {
			ListNode q = new ListNode(a[i]);
			p.next = q;
			p = q;
		}
		return head;
	}

	public static void display(ListNode head) {
		ListNode p = head;
		while (p != null) {
			System.out.println(p.val);
			p = p.next;
		}
	}

	public static ListNode reverse(ListNode head) {
		ListNode pre = new ListNode(-1);
		ListNode p = head;
		ListNode q;
		while (p != null) {
			q = p.next;
			p.next = pre.next;
			pre.next = p;
			p = q;
		}
		return pre.next;
	}

	public static ListNode reverse(ListNode p, int k) {
		ListNode pre = new ListNode(-1);
		ListNode px = p;
		ListNode q = px.next;
		for (int i = 0; i < k ; i++) {
			q = px.next;
			px.next = pre.next;
			pre.next = px;
			px = q;
		}
		return pre.next;
	}
	public static ListNode reverseKGroup(ListNode head, int k) {
		if(head==null || head.next==null || k<1){
			return head;
		}
		ListNode pre = new ListNode(-1);
		ListNode startpre = pre;
	    ListNode p = head;
	    //ListNode prem = pre;
	    ListNode pm = p;
	   // boolean flag = false;
	    ListNode r = head;
	    int count = 0;
	    while(r!=null){
	    	r = r.next;
	    	count++;
	    }
	    if(count<k){
	    	return head;
	    }
	    while(true){
	    	int i;
	    	for( i=0;i<k && pm!=null;i++){
	    		//prem = pm;
	    		pm = pm.next;
	    	}
	    	/*if(pm==null && i<k &&flag == false){
	    		return head;
	    	}
	    	if(pm==null && i>=k && flag == false){
	    		ListNode x = reverse(p, k);
	    		pre.next = x;
	    	}*/
	    	if(i>=k ){
	    	//	flag = true;
	    		ListNode x = reverse(p, k);
	    		pre.next = x;
	    		/*pre = prem;*/
	    		for(int j=0;j<k;j++){
	    			pre = pre.next;
	    		}
	    		pre.next = pm;
	    		p = pm;
	    	}
	    	if(i<k){
	    		
	    		break;
	    	}
	    }
	    return startpre.next;
    }
    
	public static void main(String[] args) {
		int[] a = { 1, 2};
		ListNode head = create(a);
		//display(head);
		/*ListNode headB = reverse(head);
		System.out.println();
		display(headB);*/
		
		
		ListNode headC = reverseKGroup(head, 3);
		display(headC);
	}

}

class ListNode {
	int val;
	ListNode next;

	ListNode(int x) {
		val = x;
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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 l...
  • will130
  • will130
  • 2015年12月20日 23:59
  • 276

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...

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. k...

[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 l...

Leetcode25 Reverse Nodes in k-Group

Reverse Nodes in k-Group My Submissions Question Solution Given a linked list, reverse the nod...

[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...

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...

leetcode 25:Reverse Nodes in k-Group(C)

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

LeetCode 25. Reverse Nodes in k-Group(反转链表)

原题网址:https://leetcode.com/problems/reverse-nodes-in-k-group/ Given a linked list, reverse the node...
  • jmspan
  • jmspan
  • 2016年05月20日 10:35
  • 342

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

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