From 4bb3874d4bbd36d0b85b74031a74479faa9306b7 Mon Sep 17 00:00:00 2001 From: Mohammad Sajid Anwar Date: Tue, 28 Jan 2025 10:42:05 +0000 Subject: - Added solutions by Mark Anderson. - Added solutions by Lubos Kolouch. - Added solutions by Eric Cheung. - Added solutions by Ulrich Rieke. - Added solutions by E. Choroba. - Added solutions by Peter Campbell Smith. - Added solutions by Niels van Dijke. - Added solutions by Conor Hoekstra. - Added solutions by Andreas Mahnke. - Added solutions by David Ferrone. - Added solutions by Peter Meszaros. - Added solutions by PokGoPun. - Added solutions by W. Luis Mochan. --- challenge-306/eric-cheung/python/ch-1.py | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100755 challenge-306/eric-cheung/python/ch-1.py (limited to 'challenge-306/eric-cheung/python/ch-1.py') diff --git a/challenge-306/eric-cheung/python/ch-1.py b/challenge-306/eric-cheung/python/ch-1.py new file mode 100755 index 0000000000..1f6acfd4ab --- /dev/null +++ b/challenge-306/eric-cheung/python/ch-1.py @@ -0,0 +1,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 ===== -- cgit