点击打开链接
///head指示的就是链表的首元素。 快慢指针
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<vector>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* rotateRight(ListNode* head, int k) {
if(!head) return NULL;
int n=0;
ListNode *cur=head;
while(cur){
++n;
cur=cur->next;
}
k%=n;
ListNode* fast=head, *slow=head;
for(int i=0;i<k;i++){
if(fast){
fast=fast->next;
}
}
if(!fast) return head;
while(fast->next){
fast=fast->next;
slow=slow->next;
}
fast->next=head;///链表尾与head相联
fast=slow->next;///fast作为新链表头
slow->next=NULL;///链表尾部下一位设置为NULL
return fast;
}
};
int main()
{
Solution temple;
return 0;
}