-
Notifications
You must be signed in to change notification settings - Fork 0
/
snail.py
139 lines (113 loc) · 4.73 KB
/
snail.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
"""
Snail Sort
link: https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1
Given an n x n array, return the array elements arranged from outermost elements to the middle element, traveling clockwise.
array = [[1,2,3],
[4,5,6],
[7,8,9]]
snail(array) #=> [1,2,3,6,9,8,7,4,5]
For better understanding, please follow the numbers of the next array consecutively:
array = [[1,2,3],
[8,9,4],
[7,6,5]]
snail(array) #=> [1,2,3,4,5,6,7,8,9]
NOTE: The idea is not sort the elements from the lowest value to the highest; the idea is to traverse the 2-d array in a clockwise snailshell pattern.
NOTE 2: The 0x0 (empty matrix) is represented as en empty array inside an array [[]].
"""
def snail(snail_map):
print("__snail_start__")
snail_len = len(snail_map[0])
current_i = 0
current_j = 0
result_list = []
iteration_len = snail_len
current_action = 0
while iteration_len > 0:
if iteration_len == snail_len:
counter = 1
else:
counter = 2
while counter > 0:
counter -= 1
if current_action == 0:
print('right {} from {}{} to {}{}'.format(iteration_len,
current_i,
current_j,
current_i,
current_j + iteration_len - 1,
))
iterations = current_j + iteration_len - 1
while current_j <= iterations:
result_list.append(snail_map[current_i][current_j])
current_j += 1
current_i += 1
current_j -= 1
elif current_action == 1:
print('down {} from {}{} to {}{}'.format(iteration_len,
current_i,
current_j,
current_i + iteration_len - 1,
current_j,
))
iterations = current_i + iteration_len - 1
while current_i <= iterations:
result_list.append(snail_map[current_i][current_j])
current_i += 1
current_i -= 1
current_j -= 1
elif current_action == 2:
print('left {} from {}{} to {}{}'.format(iteration_len,
current_i,
current_j,
current_i,
abs(current_j - iteration_len + 1),
))
iterations = abs(current_j - iteration_len + 1)
while current_j >= iterations:
result_list.append(snail_map[current_i][current_j])
current_j -= 1
current_i -= 1
current_j += 1
elif current_action == 3:
print('up {} from {}{} to {}{}'.format(iteration_len,
current_i,
current_j,
abs(current_i - iteration_len + 1),
current_j,
))
iterations = abs(current_i - iteration_len + 1)
while current_i >= iterations:
result_list.append(snail_map[current_i][current_j])
current_i -= 1
current_i += 1
current_j += 1
current_action = (current_action + 1) % 4
iteration_len -= 1
print(result_list)
print("__snail_end__\n")
return result_list
def main():
array = [[1, 2],
[4, 5]]
snail(array)
array = [[1, 2, 3],
[4, 5, 6],
[7, 8, 9]]
snail(array)
array = [[1, 2, 3],
[8, 9, 4],
[7, 6, 5]]
snail(array)
array = [[1, 2, 3, 4],
[5, 6, 7, 8],
[9, 10, 11, 12],
[13, 14, 15, 16]]
snail(array)
array = [[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]]
snail(array)
if __name__ == "__main__":
main()