【每日一题1227】最大年龄

[Amoyshmily (霍格沃兹-百里)]

已知一个包含表示年龄的数字列表，它至少会包含2个元素，并且是无序的。请编写一个函数，返回其中最大的两个年龄列表，并且按照生序排列。

示例：
输入：[1, 3, 10, 0]，返回：[3, 10]

题目难度：简单
题目来源：Codewars: Two Oldest Ages

def solution(ages: list) -> list:
    # your code

assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[nobugs]

def solution(ages: list) -> list:
    return sorted(ages, reverse=False)[-2:]


assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[yanghaotai_7862]

def solution(ages: list) -> list:
	ages = set(ages)
	sortages = list(ages)
	sortages.sort()
	return [sortages[-2],sortages[-1]]

[Kawi]

def solution(ages: list) -> list:
    ages.sort()
    ages = ages[-2:]
    return ages

[Mooii]

def solution(ages: list) -> list:
    ages.sort()
    return ages[-2:]

assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[1831718564_5640]

def solution9(ll:list):
    ll.sort(reverse=True)
    return [ll[1],ll[0]]
assert solution9([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution9([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution9([10, 1]) == [1, 10]

[1092939085 (YX)]

def solution(ages: list) -> list:
    return sorted(ages)[-2:]


assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[Stone1688 (石头)]

def solution(ages: list) -> list:
    return sorted(ages)[-2:]

assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[Huis]

def solution(ages: list) -> list:
    if len(ages)<2: return ages
    result = [float("-inf")]
    for i in range(len(ages)):
        if i == 0: result.append(ages[i])
        else:
            if ages[i] > result[len(result)-1]:
                result[0]= result[len(result)-1]
                result[1]= ages[i]
            elif ages[i] > result[0]: result[0]=ages[i]
    return result

[535402748 (习惯了习惯)]

def solution(ages: list) -> list:
    return sorted(ages)[-2:]

[kary]

def solution(ages: list) -> list:
    # your code
    ages.sort()
    return ages[-2:]


assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[abyss]

def solution(age: list):
    return sorted(age)[-2:]


assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[wangke (CR7)]

def solution(ages):
ages.sort()
return ages[-2:]

assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]预先格式化的文本

[lekaixin (ALe阿乐)]

def solution(ages: list) -> list:
    return sorted(ages)[-2:]

assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

[zww1]

11111

[zww1]

111

[longmin]

def solution(ages: list) -> list:
    return sorted(ages,reverse=False)[-2:]

[oo7xa0-ytfzuw6cnlrpc (筱珂噯🥰 🤩)]

@Amoyshmily

def solution(ages: list) -> list:
   if len(ages) <= 2:
        return ages[::-1]
    ages.sort(reverse=False)
    return ages[-2:]

assert solution([1, 5, 87, 45, 8, 8]) == [45, 87]
assert solution([6, 5, 83, 5, 3, 18]) == [18, 83]
assert solution([10, 1]) == [1, 10]

def solution(ages: list) → list:

if len(ages) <= 2:
    return ages[::-1]
ages.sort(reverse=False)
return ages[-2:]

[2379657845_5394]

MoonBoat - 每日一题 - 1

def two_oldest_ages(ages):
#your code here
ages.sort()
l = len(ages)
answer = [ages[l-2], ages[l-1]]
return answer