LeetCode Rotate List

题意：给出一个单链表，将其右旋转k，其中k为非0

思路：首先统计单链表的结点数，因为k可能大于这个。将k转成小于单链表的结点数，先从头开始遍历k个，在继续遍历时，另一个从头开始，当遍历到尾时，另一个已经到离右边的第 k个。

代码如下：

class Solution
{public ListNode rotateRight(ListNode head, int k){if (null == head ) return head;int cnt = 0;ListNode cur = head, p = head;while (cur != null){cnt++;cur = cur.next;}k %= cnt;if (0 == k) return head;cnt = 0;cur = head;while (cnt++ < k){cur = cur.next;if (null == cur) return head;}while (cur.next != null){cur = cur.next;p = p.next;}ListNode ans = p.next;p.next = null;cur.next = head;return ans;}
}

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相关推荐

最新文章

热门文章