FilesExpand file tree

 master

/

206.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (32 loc) · 552 Bytes

 master

/

206.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (32 loc) · 552 Bytes

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

#include "stdafx.h"

using namespace std;

/*

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL

输出: 5->4->3->2->1->NULL

进阶:

你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

*/

class Solution {

public:

ListNode* reverseList(ListNode* head) {

if (head == nullptr || head->next == nullptr)

{

return head;

}

ListNode* pre = head;

ListNode* cur = head->next;

ListNode* r;

head->next = nullptr;

while (cur != nullptr)

{

r = cur->next;

cur->next = pre;

pre = cur;

cur = r;

}

head = pre;

return head;

}

};