forked from fantastic-Feifei/Leetcode_Solutions_python3
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path92_reverseBetween.py
More file actions
executable file
·71 lines (39 loc) · 1.23 KB
/
92_reverseBetween.py
File metadata and controls
executable file
·71 lines (39 loc) · 1.23 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
# Definition for singly-linked list.
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
def create_list(content):
head = ListNode(val=content[0], next=None)
ptr = head
for i in content[1:]:
ptr.next = ListNode(val=i, next=None)
ptr = ptr.next
return head
def printList(head: ListNode) -> [int]:
array = []
cur = head
while cur:
array.append(cur.val)
cur = cur.next
return array
class Solution:
connector = ListNode(0, None)
def reverseNthNode(self, head: ListNode, n: int) -> ListNode:
global connector
if(n == 1):
connector = head.next
return head
reverse_head = self.reverseNthNode(head.next, n-1)
head.next.next = head
head.next = connector
return reverse_head
def reverseBetween(self, head: ListNode, m: int, n: int) -> ListNode:
if (m == 1): return self.reverseNthNode(head, n)
head.next = self.reverseBetween(head.next, m-1, n-1)
return head
head = create_list([1, 2, 3, 4, 5, 6])
head = create_list([])
ob = Solution()
ans = printList(ob.reverseBetween(head, 3, 6))
ans