Given a list, rotate the list to the right by
k places, where
k is non-negative.
k = 2, return
k might be larger than the size of the list, so we actually only rotates for
k % size times.
Once we have the
size and the modified
k, we can move a pointer to the
size - k-th node, then it is straight forward to update the links.