I am working on the following Python list exercise from codingbat.com:
Given an array of ints, return the sum of the first 2 elements in the array.
There is. Two elements of the solution - builtin function sum and lists's slices:
>>> sum([1,2,3][:2])
3
>>> sum([1,1,1,1][:2])
2
>>> sum([1,1][:2])
2
>>> sum([1][:2])
1
>>> sum([][:2])
0
try this:
def sum2(nums):
if len(nums) == 1:
return nums[0]
else:
return sum(nums [:2])
If you can't use sum, one possible solution uses exceptions:
totalsum = 0
try:
totalsum += nums[0]
totalsum += nums[1]
except IndexError:
pass
return totalsum
Catch the error and short-circuit the summation if an element doesn't exist. Easier to ask forgiveness than permission, as they say.