Shatteredxu#javaKI#2021-04-30__旋转链表__复原ip地址1

### [61. 旋转链表](https://leetcode-cn.com/problems/rotate-list/) 自己写的暴力解法，先找倒数k个节点然后进行拼接 ```java class Solution { public ListNode rotateRight(ListNode head, int k) { if(head ==null||k==0){return head;} int n = 1; ListNode first = head; while(head.next!=null){ n++; head = head.next; } ListNode last = head; k = k%n; if(k==0){return first;} ListNode lastK = first; int Knum = 0; head = first; while(head.next!=null){ if(Knum