Non-unique Elements

题目

Non-unique Elements

思路

dict存每个数字出现的次数,出现一次的remove掉

我的代码

#Your optional code here
#You can import some modules or create additional functions


def checkio(data: list) -> list:
    #遍历一遍,dict分别记录各数字的次数
    number_map = {}

    for number in data:
        if number_map.__contains__(number):
            number_map[number] += 1
        else:
            number_map[number] = 1

    #remove操作
    for key in number_map:
        if number_map[key] == 1:
            data.remove(key)

    return data

#Some hints
#You can use list.count(element) method for counting.
#Create new list with non-unique elements
#Loop over original list


if __name__ == "__main__":
    #These "asserts" using only for self-checking and not necessary for auto-testing
    assert list(checkio([1, 2, 3, 1, 3])) == [1, 3, 1, 3], "1st example"
    assert list(checkio([1, 2, 3, 4, 5])) == [], "2nd example"
    assert list(checkio([5, 5, 5, 5, 5])) == [5, 5, 5, 5, 5], "3rd example"
    assert list(checkio([10, 9, 10, 10, 9, 8])) == [10, 9, 10, 10, 9], "4th example"
    print("It is all good. Let's check it now")

clear code

def checkio(data):
        return [i for i in data if data.count(i) > 1]

creative code

感觉这一类型的好多都是用lambda

checkio = lambda d: list(filter(lambda i: d.count(i) - 1, d))
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值