-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path24_swap_nodes_in_pairs.py
72 lines (59 loc) · 2.19 KB
/
24_swap_nodes_in_pairs.py
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
72
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
# Solution 1: Change values
class Solution:
def swapPairs(self, head: ListNode) -> ListNode:
arr = []
curr = head
while curr != None:
arr.append(curr.val)
curr = curr.next
for i in range(0, len(arr)-1, 2):
arr[i], arr[i+1] = arr[i+1], arr[i]
curr = head
i = 0
while curr != None:
curr.val = arr[i]
curr = curr.next
i += 1
return head
# Solution 2: Change nodes
class Solution:
def swapPairs(self, head: ListNode) -> ListNode:
dummy = ListNode(0, head)
temp = dummy
while (temp.next != None) and (temp.next.next != None):
node1 = temp.next
node2 = temp.next.next
temp.next = node2
node1.next = node2.next
node2.next = node1
temp = node1
return dummy.next
# Solution 3: Recursion
class Solution:
def swapPairs(self, head: ListNode) -> ListNode:
if (head == None) or (head.next == None):
return head
new_head = head.next
head.next = self.swapPairs(new_head.next)
new_head.next = head
return new_head
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''