diff options
| author | 冯昶 <fengchang@novel-supertv.com> | 2023-07-17 18:07:20 +0800 |
|---|---|---|
| committer | 冯昶 <fengchang@novel-supertv.com> | 2023-07-17 18:07:20 +0800 |
| commit | 1d3872b50d7fe670c5910388f163da55ded8fa77 (patch) | |
| tree | 50e95b7831dd9e3155a074b2a41e5fdf905063df /challenge-225/eric-cheung/python | |
| parent | 868de39e9ccd2c5187f4a34e78f5348e86698844 (diff) | |
| parent | d4c19914d808b095e1f4832042c5db8c645d0aae (diff) | |
| download | perlweeklychallenge-club-1d3872b50d7fe670c5910388f163da55ded8fa77.tar.gz perlweeklychallenge-club-1d3872b50d7fe670c5910388f163da55ded8fa77.tar.bz2 perlweeklychallenge-club-1d3872b50d7fe670c5910388f163da55ded8fa77.zip | |
Merge remote-tracking branch 'upstream/master'
Diffstat (limited to 'challenge-225/eric-cheung/python')
| -rwxr-xr-x | challenge-225/eric-cheung/python/ch-1.py | 8 | ||||
| -rwxr-xr-x | challenge-225/eric-cheung/python/ch-2.py | 19 |
2 files changed, 27 insertions, 0 deletions
diff --git a/challenge-225/eric-cheung/python/ch-1.py b/challenge-225/eric-cheung/python/ch-1.py new file mode 100755 index 0000000000..f0095f08e1 --- /dev/null +++ b/challenge-225/eric-cheung/python/ch-1.py @@ -0,0 +1,8 @@ +
+## arrWordList = ["Perl and Raku belong to the same family.", "I love Perl.", "The Perl and Raku Conference."] ## Example 1
+arrWordList = ["The Weekly Challenge.", "Python is the most popular guest language.", "Team PWC has over 300 members."] ## Example 2
+
+arrWordLen = [len(wordLoop.split()) for wordLoop in arrWordList]
+nMaxWordLen = max(arrWordLen)
+
+print (nMaxWordLen)
diff --git a/challenge-225/eric-cheung/python/ch-2.py b/challenge-225/eric-cheung/python/ch-2.py new file mode 100755 index 0000000000..64e98389f4 --- /dev/null +++ b/challenge-225/eric-cheung/python/ch-2.py @@ -0,0 +1,19 @@ +
+## arrInt = [10, 4, 8, 3] ## Example 1
+## arrInt = [1] ## Example 2
+arrInt = [1, 2, 3, 4, 5] ## Example 3
+
+arrLeft = [0]
+arrRight = [0]
+
+for nIndx in range(len(arrInt) - 1):
+ arrLeft.append(arrLeft[-1] + arrInt[nIndx])
+ arrRight.append(arrRight[-1] + arrInt[len(arrInt) - nIndx - 1])
+
+arrRight.reverse()
+
+arrLeftRightSumDiff = [abs(arrLeft[nIndx] - arrRight[nIndx]) for nIndx in range(len(arrLeft))]
+
+## print (arrLeft)
+## print (arrRight)
+print (arrLeftRightSumDiff)
|