首页 > 代码库 > Leetcode 61 -- Rotate List
Leetcode 61 -- 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
.
Subscribe to see which companies asked this question.
Note: 注意K可能很大,可能会超时。
public ListNode rotateRight(ListNode head, int k) { if (head == null) { return null; } ListNode before = head; ListNode after = head; // get length int length = 0; while(after != null) { length++; after = after.next; } // get valid k less than length k = k % length; after = head; for(int i=0; i<k; i++) { after = after.next; } while (after.next != null) { before = before.next; after = after.next; } after.next = head; head = before.next; before.next = null; return head; }
Leetcode 61 -- Rotate List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。