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. 思考:先首尾連成環,head前進(len-k%len)步,拆環
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. 巨沒勁的一道題,當k>length 時,我以為origin