challenge-152/lubos-kolouch/python/ch-1.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

""" Challenge 152 Task 1 """


def get_min_count(in_arr: list):
    """ Find out the lists minimum """

    min_sum = 0

    for sub_arr in in_arr:

        # so obviously it is not a tree, just independent arrays
        # so I can just take a min from each row

        min_sum += min(sub_arr)

    return min_sum


assert get_min_count([[1], [5, 3], [2, 3, 4], [7, 1, 0, 2], [6, 4, 5, 2,
                                                             8]]) == 8
assert get_min_count([[5], [2, 3], [4, 1, 5], [0, 1, 2, 3], [7, 2, 4, 1,
                                                             9]]) == 9