aboutsummaryrefslogtreecommitdiff
path: root/challenge-213/eric-cheung/python/ch-2.py
blob: 05dfcf5909b7e1b8aa1d2cba375932f6fdd70a1c (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
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
## Example 1:
## arrInputRouteList = [[1, 2, 6], [5, 6, 7]]
## nSource = 1
## nDestination = 7

## Example 2:
## arrInputRouteList = [[1, 2, 3], [4, 5, 6]]
## nSource = 2
## nDestination = 5

## Example 3:
arrInputRouteList = [[1, 2, 3], [4, 5, 6], [3, 8, 9], [7, 8]]
nSource = 1
nDestination = 7

nSourceIndx = -1
nDestinationIndx = -1

arrOutputRouteList = []

for nIndx, arrLoop in enumerate(arrInputRouteList):
    if nSource in arrLoop:
        nSourceIndx = nIndx
    elif nDestination in arrLoop:
        nDestinationIndx = nIndx

## print (nSourceIndx)
## print (nDestinationIndx)

if nSourceIndx < 0 or nDestinationIndx < 0:
    print (-1)
elif nSourceIndx == nDestinationIndx:
    nStartIndx = arrInputRouteList[nSourceIndx].index(nSource)
    nEndIndx = arrInputRouteList[nDestinationIndx].index(nDestination)

    if nEndIndx < nStartIndx:
        for nIndx in range(nStartIndx, nEndIndx - 1, -1):
            arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])
    else:
        for nIndx in range(nStartIndx, nEndIndx + 1):
            arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])
elif len(arrInputRouteList) <= 2:
    ## Check Intersection
    arrIntersection = [nElem for nElem in arrInputRouteList[nSourceIndx] if nElem in arrInputRouteList[nDestinationIndx]]
    if len(arrIntersection) == 0:
        print (-1)
    else:
        ## Source Array Part
        nStartIndx = arrInputRouteList[nSourceIndx].index(nSource)
        nEndIndx = arrInputRouteList[nSourceIndx].index(arrIntersection[0])

        if nEndIndx < nStartIndx:
            for nIndx in range(nStartIndx, nEndIndx, -1):
                arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])
        else:
            for nIndx in range(nStartIndx, nEndIndx):
                arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])

        ## Destination Array Part
        nStartIndx = arrInputRouteList[nDestinationIndx].index(arrIntersection[0])
        nEndIndx = arrInputRouteList[nDestinationIndx].index(nDestination)

        if nEndIndx < nStartIndx:
            for nIndx in range(nStartIndx, nEndIndx - 1, -1):
                arrOutputRouteList.append(arrInputRouteList[nDestinationIndx][nIndx])
        else:
            for nIndx in range(nStartIndx, nEndIndx + 1):
                arrOutputRouteList.append(arrInputRouteList[nDestinationIndx][nIndx])

        print (arrOutputRouteList)
else:
    ## Check Intersection
    arrIntersection = [nElem for nElem in arrInputRouteList[nSourceIndx] if nElem in arrInputRouteList[nDestinationIndx]]

    if len(arrIntersection) == 0:
        nInterSourceIndx = -1
        nInterDestinationIndx = -1

        nInterSourceElem = -1
        nInterDestinationElem = -1

        for nIndx, arrLoop in enumerate(arrInputRouteList):
            if nIndx == nSourceIndx or nIndx == nDestinationIndx:
                continue

            arrIntersection = [nElem for nElem in arrInputRouteList[nSourceIndx] if nElem in arrInputRouteList[nIndx]]
            if len(arrIntersection) > 0:
                nInterSourceIndx = nIndx
                nInterSourceElem = arrIntersection[0]

            arrIntersection = [nElem for nElem in arrInputRouteList[nDestinationIndx] if nElem in arrInputRouteList[nIndx]]
            if len(arrIntersection) > 0:
                nInterDestinationIndx = nIndx
                nInterDestinationElem = arrIntersection[0]

        if nInterSourceIndx < -1 or nInterDestinationIndx < -1:
            print (-1)
        elif nInterSourceIndx == nInterDestinationIndx:
            ## Source Array Part
            nStartIndx = arrInputRouteList[nSourceIndx].index(nSource)
            nEndIndx = arrInputRouteList[nSourceIndx].index(nInterSourceElem)

            if nEndIndx < nStartIndx:
                for nIndx in range(nStartIndx, nEndIndx, -1):
                    arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])
            else:
                for nIndx in range(nStartIndx, nEndIndx):
                    arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])

            ## Inter Array Part
            nStartIndx = arrInputRouteList[nInterSourceIndx].index(nInterSourceElem)
            nEndIndx = arrInputRouteList[nInterSourceIndx].index(nInterDestinationElem)

            if nEndIndx < nStartIndx:
                for nIndx in range(nStartIndx, nEndIndx, -1):
                    arrOutputRouteList.append(arrInputRouteList[nInterSourceIndx][nIndx])
            else:
                for nIndx in range(nStartIndx, nEndIndx):
                    arrOutputRouteList.append(arrInputRouteList[nInterSourceIndx][nIndx])

            ## Destination Array Part
            nStartIndx = arrInputRouteList[nDestinationIndx].index(nInterDestinationElem)
            nEndIndx = arrInputRouteList[nDestinationIndx].index(nDestination)

            if nEndIndx < nStartIndx:
                for nIndx in range(nStartIndx, nEndIndx - 1, -1):
                    arrOutputRouteList.append(arrInputRouteList[nDestinationIndx][nIndx])
            else:
                for nIndx in range(nStartIndx, nEndIndx + 1):
                    arrOutputRouteList.append(arrInputRouteList[nDestinationIndx][nIndx])

            print (arrOutputRouteList)
    else:
        ## Source Array Part
        nStartIndx = arrInputRouteList[nSourceIndx].index(nSource)
        nEndIndx = arrInputRouteList[nSourceIndx].index(arrIntersection[0])

        if nEndIndx < nStartIndx:
            for nIndx in range(nStartIndx, nEndIndx, -1):
                arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])
        else:
            for nIndx in range(nStartIndx, nEndIndx):
                arrOutputRouteList.append(arrInputRouteList[nSourceIndx][nIndx])

        ## Destination Array Part
        nStartIndx = arrInputRouteList[nDestinationIndx].index(arrIntersection[0])
        nEndIndx = arrInputRouteList[nDestinationIndx].index(nDestination)

        if nEndIndx < nStartIndx:
            for nIndx in range(nStartIndx, nEndIndx - 1, -1):
                arrOutputRouteList.append(arrInputRouteList[nDestinationIndx][nIndx])
        else:
            for nIndx in range(nStartIndx, nEndIndx + 1):
                arrOutputRouteList.append(arrInputRouteList[nDestinationIndx][nIndx])

        print (arrOutputRouteList)