aboutsummaryrefslogtreecommitdiff
path: root/challenge-088/paulo-custodio/python/ch-2.py
blob: c2a06ba585aae073e808b533038dcf19d4b59ad1 (plain)
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
#!/usr/bin/env python3

# Challenge 088
#
# TASK #2 > Spiral Matrix
# Submitted by: Mohammad S Anwar
# You are given m x n matrix of positive integers.
#
# Write a script to print spiral matrix as list.
#
# Example 1:
# Input:
#     [ 1, 2, 3 ]
#     [ 4, 5, 6 ]
#     [ 7, 8, 9 ]
# Ouput:
#     [ 1, 2, 3, 6, 9, 8, 7, 4, 5 ]
# Example 2:
# Input:
#     [  1,  2,  3,  4 ]
#     [  5,  6,  7,  8 ]
#     [  9, 10, 11, 12 ]
#     [ 13, 14, 15, 16 ]
# Output:
#     [ 1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10 ]

import fileinput
import re

def read_input():
    lines = []
    for line in fileinput.input():
        lines.append(line)
    return lines

def read_matrix(lines):
    m = []
    for line in lines:
        line = re.sub(r"\D+", " ", line)
        cols = [int(x) for x in line.split()]
        m.append(cols)
    return m

def spiral(m):
    s = []
    while len(m) > 0:
        # put top row left-right
        for n in m[0]:
            s.append(n)
        m.pop(0)

        # put right column top-bottom
        if len(m) > 0 and len(m[0]) > 0:
            for r in range(len(m)):
                s.append(m[r].pop(-1))

        # put bottom row right-left
        if len(m) > 0:
            for n in m[-1][::-1]:
                s.append(n)
            m.pop(-1)

        # put left column top-bottom
        if len(m) > 0 and len(m[-1]) > 0:
            for r in range(len(m))[::-1]:
                s.append(m[r].pop(0))
    return s

s = spiral(read_matrix(read_input()))
print("[ "+ ", ".join([str(x) for x in s]) +" ]")