Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Partition To 2 Equal Sum Subsets From An Array of Integers
def cutHalf(numlist): num = sum(numlist)/2 #print(num) cut = 0 for item in numlist: cut += item if cut == num: return numlist.index(item) #numlist = [5,5,3,3,3,2,2,2,1] numlist = [1,2,3,6] print(cutHalf(numlist))
run
|
edit
|
history
|
help
0
haha
Hello
selenium -proj
test3.py
Faiha #4
Random integers
Prime Factors
Юра и заселение
HW. InsertionSort in Descending order
31 dec