FilesExpand file tree

master

/

rotateList.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

54 lines (47 loc) · 1.28 KB

master

/

rotateList.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

54 lines (47 loc) · 1.28 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

// Source : https://oj.leetcode.com/problems/rotate-list/

// Author : Hao Chen

// Date : 2014-06-20

/**********************************************************************************

*

* 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.

*

**********************************************************************************/

/**

* Definition for singly-linked list.

* struct ListNode {

* int val;

* ListNode *next;

* ListNode(int x) : val(x), next(NULL) {}

* };

*/

class Solution {

public:

ListNode *rotateRight(ListNode *head, int k) {

if (!head || k<=0){

return head;

}

//find the length of List

int len=1;

ListNode *p=head;

while( p->next != NULL ){

p = p->next;

len++;

}

//connect the tail to head

p->next = head;

//find the left place (take care the case - k > len)

k = len - k % len;

//find the place

for(int i=0; i<k; i++){

p = p->next;

}

//break the list

head = p->next;

p->next = NULL;

return head;

}

};