forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 1
/
problem_256.py
51 lines (38 loc) · 949 Bytes
/
problem_256.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
class Node:
def __init__(self, x):
self.val = x
self.next = None
def __str__(self):
string = "["
node = self
while node:
string += "{} ->".format(node.val)
node = node.next
string += "None]"
return string
def get_nodes(values):
next_node = None
for value in values[::-1]:
node = Node(value)
node.next = next_node
next_node = node
return next_node
def get_list(head):
node = head
nodes = list()
while node:
nodes.append(node.val)
node = node.next
return nodes
def rearrange(llist):
if not llist.next:
return llist
arr = get_list(llist)
arr.sort()
for i in range(2, len(arr), 2):
tmp = arr[i]
arr[i] = arr[i-1]
arr[i-1] = tmp
return get_nodes(arr)
# Tests
assert get_list(rearrange(get_nodes([1, 2, 3, 4, 5]))) == [1, 3, 2, 5, 4]