Program print numbers which sum is highest

Question

Program go through the list and print number which digits have the highest sum. I have an idea of getting digits of numbers and saving it to a list and doing the same for the next number but in other list.Then compare these two lists and print the number with the highest list.

I tried something but it don't work how I wanted it.

brojevi = [21, 35, -43, 2, 80, -1, 7, 0]

tmax = []
tmax2 = []

for i in brojevi:
    broj1 = i
    broj2 = i +1
    while broj1 > 0:
        cifra1 = broj1 % 10
        tmax.append(cifra1)
        broj1 //= 10
        print(cifra1)
        print(broj1)
    print("-----------------")
    while broj2 > 0:
        cifra2 = broj2 % 10
        tmax2.append(cifra2)
        broj2 //= 10
        print(cifra2)
        print(broj2)
    print("-----------------")

zbir1 = sum(tmax)
print("-----------------")
zbir2 = sum(tmax2)
print(zbir1)
print(zbir2)
if zbir1 > zbir2:
    print("najveci: ", i)
print(tmax)
print(tmax2)

Prints in code are for test purposes.

So expected output would be "80" in this case? What's the effect of negative signs (i.e. is "-43" a "-1")? — Boern, Dec 15 '21 at 15:33
https://stackoverflow.com/questions/14939953/sum-the-digits-of-a-number — Boern, Dec 15 '21 at 15:35
Saw that, but what's expected to happen with "-43". Is that a 7 or a -1? — Boern, Dec 15 '21 at 15:46
Does this answer your question? [Sum the digits of a number](https://stackoverflow.com/questions/14939953/sum-the-digits-of-a-number) — Boern, Dec 16 '21 at 07:52

Boern · Answer 1 · 2021-12-16T07:51:28.037

0

brojevi = [21, 35, -43, 2, 80, -1, 7, 0]

# see https://stackoverflow.com/a/14940026/1701600
def sum_digits(n):
    s = 0
    n = abs(n)
    while n:
        s += n % 10
        n //= 10
    return s
    
max_cross_sum = -1
max_num = None
for num in brojevi:
    cross_sum = sum_digits(num)
    
    if cross_sum > max_cross_sum:
        max_cross_sum = cross_sum
        max_num = num
        
print(f"max cross sum is ${max_cross_sum} for number ${max_num}")

edited Dec 16 '21 at 07:51

answered Dec 15 '21 at 15:42

Boern

7,233
5
55
86

Did you try that? For me that's an endless loop in `sum_digits` for the negative numbers. – Matthias Dec 15 '21 at 15:56
Nope, was on the phone. I added an `abs` – Boern Dec 16 '21 at 07:51

score 0 · Answer 2 · answered Dec 15 '21 at 15:50

I would construct a new list with tuples containing the sum of each number and the original number. Then you can get the max sum from this list. Finally iterate over the list, compare if the sum in the tuple equals the max sum and then print the matching value.

brojevi = [21, 35, -43, 2, 80, -1, 7, 0]
totals = [(sum(int(digit) for digit in str(number) if digit.isdigit()), number) for number in brojevi]
print(totals)
max_sum = max(totals, key=lambda x: x[0])[0]
print(max_sum)
for entry in totals:
    if entry[0] == max_sum:
        print(f'Highest number is {entry[1]}')

Output (including debugging outputs):

[(3, 21), (8, 35), (7, -43), (2, 2), (8, 80), (1, -1), (7, 7), (0, 0)]
8
Highest number is 35
Highest number is 80

This approach only takes digits into account. The "-" is dropped.

Clement H. · Answer 3 · 2021-12-15T18:10:39.523

0

Use the sum_digits3 function from Sum the digits of a number

import numpy as np 

def sum_digits3(n):
    r = 0
    while n:
        r, n = r + n % 10, n // 10
    return r

brojevi = [21, 35, -43, 2, 80, -1, 7, 0]

sumed_brojevi = [sum_digits(abs(n)) for n in brojevi]
brojevi[np.argmax(sumed_brojevi)]

edited Dec 15 '21 at 18:10

answered Dec 15 '21 at 17:21

Clement H.

1,339
2
8
6

score 0 · Answer 4 · answered Dec 15 '21 at 17:24

you can use the key parameter of the max function. This will allow you to get the number with the highest sum of digits by supplying the key parameter with a lambda (or function) to get the sum for an individual number's digits:

brojevi = [21, 35, -43, 2, 80, -1, 7, 0]

result = max(brojevi,key=lambda n:sum(map(int,str(abs(n))))) # 35

str(abs(n)) will convert the number n into a string (without the sign)
map(int,...) will convert each character of the string into an integer
sum(...) will add up the integers produced by map() giving the sum of digits
max(brojevi,key=lambda n:...) will find the number in brojevi that has the highest key value (in this case sum of digits)

score -1 · Answer 5 · edited Dec 15 '21 at 17:58

-1

Try max() method

newlist = max(yourlist)

print(newlist)

And if you want to get index of the maxvalue than

inlistmaxvalue = yourlist.index(newlist)

edited Dec 15 '21 at 17:58

Muhammad Dyas Yaskur

6,914
10
48
73

answered Dec 15 '21 at 15:35

Priya BB

3
5

As it’s currently written, your answer is unclear. Please [edit] to add additional details that will help others understand how this addresses the question asked. You can find more information on how to write good answers [in the help center](/help/how-to-answer). – Community Dec 15 '21 at 17:21

Program print numbers which sum is highest

5 Answers5