checkio The Highest Building

题目:
Input: Heights of the buildings as a 2D-array.

Output: The number of the highest building and height of it as a list of integers (Important: in this task the building numbers starts from “1”, not from “0”)

Example:

highest_building([[0, 0, 1, 0],
[1, 0, 1, 1],
[1, 1, 1, 1],
[1, 1, 1, 1]]) == [3, 4]
链接:
https://py.checkio.org/en/mission/the-highest-building/
代码:

def highest_building(buildings):
    a = buildings
    s = []
    b = 0    
    for j in range(0, len(a[0])):
        for i in a:
    		b += i[j]
    	s.append(b)
    	b = 0
    xx = list(enumerate(s))

    yy = sorted(xx, key = lambda x: x[1])
    zz = [yy[-1][0]+1, yy[-1][1]]
    return zz
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值