Leetcode Problem Solving-list (2.2.6) rotatelist

1Title:Rotate List

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->nullptr and k = 2, return 4->5->1->2->3->nullptr.

2Implement

First of all, determine which nodes are required for the rotation of the topic:Dummy head node, node K, tail node, and then to locate. Note that the topic mentions that the pre-condition K is non-negative, so determine if K is out of bounds. When the final rotation is careful not to form a circular linked list, resulting in a dead loop when printing the list!

Leetcode Problem Solving-list (2.2.6) rotatelist