leetcode--Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.

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

为了方便，使用了哨兵节点。

java：

/*** Definition for singly-linked list.* public class ListNode {*     int val;*     ListNode next;*     ListNode(int x) {*         val = x;*         next = null;*     }* }*/
public class Solution {public ListNode rotateRight(ListNode head, int n) {if(head==null||head.next==null||n==0)return head;int cnt=0;ListNode p=head;while(p!=null){cnt++;p=p.next;}if(n==cnt)return head;n=n%cnt;if(0==n)return head;ListNode h = new ListNode(-1);h.next=head;ListNode q=h;int step=0;while(step<n){step++;q=q.next;}p=h;while(q.next!=null){q=q.next;p=p.next;}q.next=h.next;h.next=p.next;p.next=null;return h.next;}
}

c++：

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     ListNode *next;*     ListNode(int x) : val(x), next(NULL) {}* };*/
class Solution {
public:ListNode *rotateRight(ListNode *head, int k) {if(!head||!head->next||0==k){return head;}ListNode *p=head;int N=0;while(p){N++;p=p->next;}if(k==N)return head;k=k%N;if(k==0)return head;ListNode *h = (ListNode *)malloc(sizeof(ListNode));h->next=head;ListNode*q=h;int cnt=0;while(cnt<k){cnt++;q=q->next;}p=h;while(q->next){q=q->next;p=p->next;}q->next=h->next;h->next=p->next;p->next=NULL;ListNode *s =h->next;free(h);return s;}
};

转载于:https://www.cnblogs.com/bingtel/p/4194425.html

leetcode--Rotate List相关推荐

LeetCode——Rotate Image（二维数组顺时针旋转90度）
问题: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwis ...
LeetCode Rotate Array(数组的旋转)
Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array ...
LeetCode Rotate Image(矩阵的旋转)
You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise ...
[LeetCode] Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
LeetCode:Rotate Image
You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). ...
[LeetCode]Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
leetcode Rotate Array 旋转数组
Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array ...
leetcode Rotate Image
Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees ...
[LintCode/LeetCode] Rotate List
Problem Given a list, rotate the list to the right by k places, where k is non-negative. Example Giv ...
LeetCode Rotate Function(寻找规律)
题意:给出一个数组a,长度为n 其中f(0)=0*a[0]+1*a[1]+...+(n-1)*a[n-1] f(1)=0*a[n-1]+1*a[0]+...+(n-1)*a[n-2] ... f(n- ...

leetcode--Rotate List

leetcode--Rotate List相关推荐

最新文章

热门文章