aboutsummaryrefslogtreecommitdiff
path: root/challenge-306/eric-cheung/python/ch-1.py
blob: 1f6acfd4ab26f39d707bf3d47b9ecdbf437893b2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
arrInts = [2, 5, 3, 6, 4]  ## Example 1
## arrInts = [1, 3]  ## Example 2

## ===== METHOD 1 =====
## nSum = 0

## for nLen in range(1, len(arrInts) + 1, 2):
    ## ## print (nLen)

    ## for nPos in range(len(arrInts) + 1 - nLen):
        ## ## print (arrInts[nPos:nPos + nLen])
        ## nSum = nSum + sum(arrInts[nPos:nPos + nLen])

## print (nSum)
## ===== METHOD 1 =====

## ===== METHOD 2 =====
arrSum = [sum(arrInts[nPos:nPos + nLen]) for nLen in range(1, len(arrInts) + 1, 2) for nPos in range(len(arrInts) + 1 - nLen)]

print (sum(arrSum))
## ===== METHOD 2 =====