aboutsummaryrefslogtreecommitdiff
path: root/challenge-294/eric-cheung/python/ch-1.py
blob: 8dc9dbb2efbda61629de4a6dc529216b6a2fc2cc (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
arrInts = [10, 4, 20, 1, 3, 2]  ## Example 1
## arrInts = [0, 6, 1, 8, 5, 2, 4, 3, 0, 7]  ## Example 2
## arrInts = [10, 30, 20]  ## Example 3

arrInts = sorted(arrInts)

## print (arrInts)

arrOutput = []

arrSubOutput = [arrInts[0]]

for nIndxLoop in range(1, len(arrInts)):
    if arrInts[nIndxLoop] - arrInts[nIndxLoop - 1] != 1:
        arrOutput.append(arrSubOutput)
        arrSubOutput = []

    arrSubOutput.append(arrInts[nIndxLoop])

arrOutput.append(arrSubOutput)

## print (arrOutput)

nMaxLen = max([len(arrLoop) for arrLoop in arrOutput])

print (-1 if nMaxLen == 1 else nMaxLen)