-
Notifications
You must be signed in to change notification settings - Fork 25
Expand file tree
/
Copy path206_ReverseLinkedList.py
More file actions
54 lines (40 loc) · 1.06 KB
/
Copy path206_ReverseLinkedList.py
File metadata and controls
54 lines (40 loc) · 1.06 KB
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
# coding: utf8
"""
题目链接: https://leetcode.com/problems/reverse-linked-list/description.
题目描述:
Reverse a singly linked list.
click to show more hints.
Hint:
A linked list can be reversed either iteratively or recursively. Could you implement both?
"""
# Definition for singly-linked list.
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None
class Solution(object):
def reverseList_v1(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
cursor = None
while head:
node = head.next
head.next = cursor
cursor = head
head = node
return cursor
def reverseList_v2(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if not head:
return None
if not head.next:
return head
node = self.reverseList_v2(head.next)
head.next.next = head
head.next = None
return node