challenge-306/eric-cheung/python/ch-2.py


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

## arrInts = [3, 8, 5, 2, 9, 2]  ## Example 1
arrInts = [3, 2, 5]  ## Example 2

while len(arrInts) > 1:
    arrInts = sorted(arrInts)
    
    nY = arrInts[-1]
    nX = arrInts[-2]

    del arrInts[-2]
    del arrInts[-1]

    if nY > nX:
        arrInts.append(nY - nX)

print (0 if len(arrInts) == 0 else arrInts[0])