【每日一题20220304】数字对对碰

兴趣爱好交流 每日一题
1

:mage:t2: 我们今天的任务是比较两个数字列表，分别比较每个索引位置上的数字，保留由其中较大数字组成的新列表。列表的数字都相同，并且互不相等。

示例：
输入： [13, 64, 15, 17, 88]，[23, 14, 53, 17, 80]
输出：[23, 64, 53, 17, 88]

题目难度：简单
题目来源：CodeWars：Number Pairs

def solution(num1: list, num2: list) -> list:
    # your code here

assert solution([13, 64, 15, 17, 88], [23, 14, 53, 17, 80]) == [23, 64, 53, 17, 88]
assert solution([99, 3, 46, 60, 120], [23, 1, 69, 12, 30]) == [99, 3, 69, 60, 120]
2

lst1 = [13, 64, 15, 17, 88]
lst2 = [23, 14, 53, 17, 80]
lst_new =
for i in lst1:
for j in lst2:
if lst1.index(i) == lst2.index(j):
if i > j:
lst_new.append(i)
elif i <= j:
lst_new.append(j)
print(lst_new)

3 
num = []
    for i in range(len(num1)):
        if num1[i] >= num2[i]:
            num.append(num1[i])
        else:
            num.append(num2[i])
    return num
4 
def solution(num1: list, num2: list) -> list:
    new_num = []
    [new_num.append(num1[i]) if num1[i]>=num2[i] else new_num.append(num2[i]) for i in range(len(num1))]
    return new_num

assert solution([13, 64, 15, 17, 88], [23, 14, 53, 17, 80]) == [23, 64, 53, 17, 88]
assert solution([99, 3, 46, 60, 120], [23, 1, 69, 12, 30]) == [99, 3, 69, 60, 120]
5 
    def solution(num1: list, num2: list) -> list:
        for i in range(len(num1)):
            if num1[i] < num2[i]:
                num1[i] = num2[i]
        return num1
6 
def solution(num1: list, num2: list) -> list:
    # your code here
    for i in range(len(num1)):
        if num1[i] < num2[i]:
            num1[i] = num2[i]
    return num1


assert solution([13, 64, 15, 17, 88], [23, 14, 53, 17, 80]) == [23, 64, 53, 17, 88]
assert solution([99, 3, 46, 60, 120], [23, 1, 69, 12, 30]) == [99, 3, 69, 60, 120]
7 
def solution(num1: list, num2: list) -> list:
    l = len(num1)
    result = []
    for i in range(l):
        result.append(max(num1[i],num2[i]))
    return result


assert solution([13, 64, 15, 17, 88], [23, 14, 53, 17, 80]) == [23, 64, 53, 17, 88]
assert solution([99, 3, 46, 60, 120], [23, 1, 69, 12, 30]) == [99, 3, 69, 60, 120]
8 
def solution(num1, num2):
    return [max(item) for item in zip(num1, num2)]
9 
def solution(num1: list, num2: list) -> list:
    # your code here

  num = []
      for i in range(len(num1)):
          if num1[i] >= num2[i]:
              num.append(num1[i])
          else:
              num.append(num2[i])
      return num
10 
def solution(num1: list, num2: list) -> list:
    new_list=[]
    i=0
    while i<len(num1) and i<len(num2):
        new_list.append(max(num1[i],num2[i]))
        i=i+1
    else:
        new_list.extend(num1[i:])
        new_list.extend(num2[i:])
    return new_list
11

def soultion(num1:list,num2:list,num3:list)->list:
for i in range(len(num1)):
if num1[i]>num2[i]:
num3.append(num1[i])
else:
num3.append(num2[i])
return num3
lp=soultion([1,3,4,5],[5,6,7,1],)
print(lp)

12 
def solution(num1: list, num2: list) -> list:
    return [max([num1[i], num2[i]]) for i in range(len(num1))]


assert solution([13, 64, 15, 17, 88], [23, 14, 53, 17, 80]) == [23, 64, 53, 17, 88]
assert solution([99, 3, 46, 60, 120], [23, 1, 69, 12, 30]) == [99, 3, 69, 60, 120]