【每日一题20220506】Bingo游戏

hogwarts · 2022 年5 月 6 日 02:08

‍ 给定一个包含10个数字的列表，数字的范围是1～26（含），分别对应大写字母表A～Z。请编写一个函数，判断这些数字是否能拼出一个’BINGO’，如果可以返回’WIN’，否则返回’LOSE’。数字允许重复，并且出现顺序不要求。

【示例】
输入：[1, 2, 3, 7, 5, 14, 7, 15, 9, 10]
输出：‘WIN’
解释：‘BINGO’字母对应的编号依次为2、9、14、7和15，输入列表中包含这些数字，因此返回’WIN’

def solution(nums: list)-> str:
    # your code here

assert solution([1, 2, 3, 7, 5, 14, 7, 15, 9, 10]) == "WIN"
assert solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == "LOSE"
assert solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]) == "WIN"

949645067_3107 · 2022 年5 月 6 日 03:15


def solution(num: list) -> str:
    def inner(target: str = "BINGO"):
        from string import ascii_uppercase
        num_str = [ascii_uppercase.index(i) + 1 for i in target]
        return all(map(lambda i: i in num, num_str))

    return "WIN" if inner() else "LOSE"

longmin · 2022 年5 月 6 日 03:43

def solution(nums: list)-> str:
    str='BINGO'
    a=[string.ascii_uppercase.index(i)+1 for i in str if i in string.ascii_uppercase]
    if all(i in nums for i in a ):
        return 'WIN'
    else:
        return 'LOSE'

1073434718_2599 · 2022 年5 月 6 日 03:44

def solution(nums: list)-> str:
    # your code here
    if all(item in [chr(i + 64) for i in nums] for item in "BINGO"):
        return "WIN"
    else:
        return "LOSE"


assert solution([1, 2, 3, 7, 5, 14, 7, 15, 9, 10]) == "WIN"
assert solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == "LOSE"
assert solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]) == "WIN"

llbai · 2022 年5 月 6 日 04:10

llbai · 2022 年5 月 6 日 04:24

还能更简洁

pizicheng · 2022 年5 月 6 日 04:28

def solution(nums: list) -> str:
   li = [2, 9, 14, 7, 15]
   n = 0
   for i in li:
      if i in nums:
         n += 1
   if n>=5:
      return 'WIN'
   else:
      return "LOSE"

assert solution([1, 2, 3, 7, 5, 14, 7, 15, 9, 10]) == "WIN"
assert solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == "LOSE"
assert solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]) == "WIN"

longmin · 2022 年5 月 6 日 06:21

def solution(nums: list)-> str:
    str='BINGO'
    a={string.ascii_uppercase.index(i)+1 for i in str if i in string.ascii_uppercase}
    return 'WIN' if a & set(nums) == a else 'LOSE'

yanxiaokan_8070 · 2022 年5 月 6 日 09:22

def solution(nums:list):
    if set([ord(i)-64 for i in "BINGO"])<=set(nums):
        return "WIN"
    else:
        return "LOSE"

if __name__ == '__main__':
    print(solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]))

1092939085 · 2022 年5 月 6 日 14:11

def solution(nums: list) -> str:
    a = [2, 9, 14, 7, 5]
    for i in a:
        if i not in nums:
            return "LOSE"
    return "WIN"


assert solution([1, 2, 3, 7, 5, 14, 7, 15, 9, 10]) == "WIN"
assert solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == "LOSE"
assert solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]) == "WIN"

nini · 2022 年5 月 7 日 01:41

from string import ascii_uppercase
def bingo(array):
# your code here
list_bingo=set([2,9,7,14,15])
set_array=set(array)
return ‘WIN’ if list_bingo<=set_array else ‘LOSE’

joyoko · 2022 年5 月 7 日 06:14

def solution(nums: list)-> str:
    # your code here
    target_li = [2, 9, 14, 7, 15]
    return "WIN" if set(target_li).issubset(set(nums)) else "LOSE"


assert solution([1, 2, 3, 7, 5, 14, 7, 15, 9, 10]) == "WIN"
assert solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == "LOSE"
assert solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]) == "WIN"

ambiguous_moonlight · 2022 年5 月 8 日 07:11

def solution(nums):
    target = [ord(letter)-64 for letter in "BINGO"]
    if any(item for item in target if item not in nums):
        return "LOSE"
    return "WIN"

lekaixin · 2024 年3 月 19 日 07:10

def solution(nums: list) -> str:
    base_str = 'BINGO'
    nums_list = [chr(nums[i] + 64) for i in range(10)]
    for i in range(len(nums_list)):
        if nums_list[i] in base_str:
            base_str = base_str.replace(nums_list[i], '')
    if base_str == '':
        return "WIN"
    else:
        return "LOSE"


assert solution([1, 2, 3, 7, 5, 14, 7, 15, 9, 10]) == "WIN"
assert solution([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == "LOSE"
assert solution([5, 2, 13, 7, 5, 14, 17, 15, 9, 10]) == "WIN"