美文网首页
61. Rotate List

61. Rotate List

作者: liuhaohaohao | 来源:发表于2018-04-10 13:19 被阅读0次

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

Example:

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

return 4->5->1->2->3->NULL.

class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head == null || k == 0){
            return head;
        }
        ListNode p = head;
        p = head;    
        int count = 1;
        while(p.next != null){
            count++;
            p = p.next;
        }
        p.next = head;
        k = k % count;
        for(int i = 0; i < count - k; i++){
            p = p.next;
        }
        head = p.next;
        p.next = null;
        
        
        return head;
        
        
    }
}

相关文章

  • 61. Rotate List

    题目61. Rotate List Given a list, rotate the list to the ri...

  • 61. Rotate List

    61. Rotate List

  • LeetCode 61-65

    61. Rotate List[https://leetcode-cn.com/problems/rotate-l...

  • 【D33】旋转链表 (LC61)

    61. 旋转链表[https://leetcode-cn.com/problems/rotate-list/] 给...

  • 61. Rotate List

    这一题边界需要考虑一些边界条件:1,k=02, 链表为空或者链表中只有一个元素 旋转的step为0代码如下:

  • 61. Rotate List

    Given a list, rotate the list to the right by k places, w...

  • 61. Rotate List

    题目 Given a list, rotate the list to the right by k places...

  • 61. Rotate List

    题目描述:给一个链表和非负整数k,将其在下标k处翻转。如: Given 1->2->3->4->5->NULL a...

  • 61. Rotate List

    Given a list, rotate the list to the right by k places, w...

  • 61. Rotate List

    Given a list, rotate the list to the right by k places, w...

网友评论

      本文标题:61. Rotate List

      本文链接:https://www.haomeiwen.com/subject/sznghftx.html