Given a list,rotate the list to right by k places, where k is nonegative.

Given a list,rotate the list to right by k places, where k is nonegative.code 给定一个列表，将列表向右旋转K个位置，其中K是非分隔的。ast ListNode *rotateRight(ListNode *head, int k) { if (head == NULL || k < 0) return NULL;

>>阅读原文<<