RL-Algorithms/test_temp.py at master · rainandwind1/RL-Algorithms · GitHub

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
import collections

Node = collections.namedtuple('Node', ['left', 'right', 'value'])

# def contains(root, value):
#     if not root:
#         return False
#     if root.value == value:
#         return True
#     return contains(root.left, value) or contains(root.right, value)

# n1 = Node(value = 1, left = None, right = None)
# n3 = Node(value = 3, left = None, right = None)
# n2 = Node(value = 2, left = n1, right = n3)

# print(contains(n2, 3), n2.value)

# def find_two_sum(numbers, target_sum):
#     res = []
#     ans = [10 - i for i in numbers]
#     for i in range(len(numbers)):
#         if ans[i] in numbers[i + 1:]:
#             res.append((i, numbers.index(ans[i])))
#     return res


# print(find_two_sum([3,1,5,7,5,9], 10))

# import collections

# res = []
# for i in target_num:
#     if i not in res:
#         res.append(i)
#     else:
#         res.remove(i)

map_matrix = [
    [True, False,False],
    [True, True, False],
    [False, True, True]
]

def route_exists(from_row, from_column, to_row, to_column, map_matrix):
    fro
    if from_column == to_column and from_row == to_row:
        return True
    if 0 <= from_column < len(map_matrix[0]) and 0 <= from_row < len(map_matrix):
        if map_matrix[from_row][from_column] == True:
            return route_exists(from_row + 1, from_column, to_row, to_column, map_matrix) or route_exists(from_row, from_column + 1, to_row, to_column, map_matrix)
        else:
            return False
    return False

print(route_exists(0,1,2,1,map_matrix))