Code Signal_练习题_alternatingSums

本文介绍如何使用Python解决数组元素交替求和的问题,并对比了两种不同的解决方案,包括作者的实现方式和官方推荐的简洁代码。通过实例分析,帮助读者理解如何优化代码并提高编程效率。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Several people are standing in a row and need to be divided into two teams. The first person goes into team 1, the second goes into team 2, the third goes into team 1 again, the fourth into team 2, and so on.

You are given an array of positive integers - the weights of the people. Return an array of two integers, where the first element is the total weight of team 1, and the second element is the total weight of team 2after the division is complete.

Example

For a = [50, 60, 60, 45, 70], the output should be
alternatingSums(a) = [180, 105].

 

 

我的解答:

def alternatingSums(a):
    sum1 = sum2 = 0
    for i in a[0::2]:
        sum1 = sum1 + i
    for j in a[1::2]:
        sum2 = sum2 + j
    return sum1,sum2

 

膜拜大佬:

def alternatingSums(a):
    return sum(a[::2]),sum(a[1::2])
View Code

 

转载于:https://www.cnblogs.com/BlameKidd/p/9357538.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值