[Leetcode] Distinct Subsequences Given a list, rotate the list to the right bykplaces, wherekis non-negative. For example: Given1->2->3->4->5->NULLandk=2, return4->5->1->2->3->NULL. K可能会大于链表的长度,坑爹! 1/**2* Definition for singly-linked list.3* struct ListNode {4...