leetcode 61. Rotate List

Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.

定义两个指针，分布指向 list 的头结点和尾结点，
将头结点插到尾部

代码：

class Solution {
public:ListNode* rotateRight(ListNode* head, int k) {ListNode *h1=head;ListNode *h2=head;if(k==0||head==NULL)return h1;int l=1;while(h1&&h1->next){h1=h1->next;l++;}//  if(l>1)int c=l-k%l;// cout<<h1->val<<endl;//  cout<<l<<endl;//   cout<<c<<endl;if(l==1)return head;for(int i=0;i<c;i++){ListNode *t=h2;h2=h2->next;cout<<h2->val<<endl;cout<<t->val<<endl;h1->next=t;h1=t;t->next=NULL;}return h2;}
};

转载于:https://www.cnblogs.com/fanhaha/p/7347132.html

leetcode 61. Rotate List相关推荐

leetcode 61 Rotate List ----- java
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
LeetCode 61. Rotate List
题目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Gi ...
【Leetcode -61.旋转链表 -82.删除排序链表中的重复元素Ⅱ】
Leetcode Leetcode -61.旋转链表 Leetcode -82.删除排序链表中的重复元素Ⅱ Leetcode -61.旋转链表题目:给你一个链表的头节点 head ,旋转链表,将链表 ...
[勇者闯LeetCode] 189. Rotate Array
[勇者闯LeetCode] 189. Rotate Array Description Rotate an array of n elements to the right by k steps. F ...
Leetcode Golang 61. Rotate List.go
思路先把list变成一个环,然后转到指定位置注意有个取模的处理 code func rotateRight(head *ListNode, k int) *ListNode {if head == ...
61. Rotate List
题目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Gi ...
LeetCode 61~65
前言本文隶属于专栏<LeetCode 刷题汇总>,该专栏为笔者原创,引用请注明来源,不足和错误之处请在评论区帮忙指出,谢谢! 本专栏目录结构请见LeetCode 刷题汇总正文幕布幕 ...
[LeetCode 题解]: Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
LeetCode 61. 旋转链表
给定一个链表,旋转链表,将链表每个节点向右移动 k 个位置,其中 k 是非负数. 示例 1: 输入: 1->2->3->4->5->NULL, k = 2 输出: 4-& ...

leetcode 61. Rotate List

leetcode 61. Rotate List相关推荐

最新文章

热门文章