[LeetCode][Java] Reverse Nodes in k-Group

473人阅读 评论(0)

题目：

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,

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

题意：

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

AC代码：

/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution
{
public ListNode reverseKGroup(ListNode head, int k)
{
int startindex=1;
int endindex=k;
int ki=0;
int Allk=0;
int kk=0;
{
kk++;
}
Allk=kk/k;
while(ki<Allk)
{
ki++;
startindex+=k;
endindex+=k;
}
}
public static ListNode reverseBetween(ListNode head, int m, int n)
{
return null;
ListNode dummy = new ListNode(0);
ListNode preNode = dummy;
int i=1;
while(preNode.next!=null && i<m)
{
preNode = preNode.next;
i++;
}
//if(i<m)
ListNode mNode = preNode.next;
ListNode cur = mNode.next;
while(cur!=null && i<n)
{
ListNode next = cur.next;
cur.next = preNode.next;
preNode.next = cur;
mNode.next = next;
cur = next;
i++;
}
return dummy.next;
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：231214次
• 积分：4590
• 等级：
• 排名：第6365名
• 原创：230篇
• 转载：99篇
• 译文：0篇
• 评论：13条
文章分类
最新评论