# Non-unique Elements

你将得到一个含有整数（X）的非空列表。在这个任务里，你应该返回在此列表中的非唯一元素的列表。要做到这一点，你需要删除所有独特的元素（这是包含在一个给定的列表只有一次的元素）。解决这个任务时，不能改变列表的顺序。例如：[1，2，3，1，3] 1和3是非唯一元素，结果将是 [1, 3, 1, 3]。输入: 一个含有整数的列表。输出: 一个含有不唯一元素的整数列表。

1checkio([1,2,3,1,3])==[1,3,1,3]
2checkio([1,2,3,4,5])==[]
3checkio([5,5,5,5,5])==[5,5,5,5,5]
4checkio([10,9,10,10,9,8])==[10,9,10,10,9]
5​

0 < |X| < 1000

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

def checkio(data):
new_data = []
for i0 in data:
if data.count(i0) > 1:
new_data.append(i0)
return new_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 isinstance(checkio([1]), list), "The result must be a list"
assert checkio([1, 2, 3, 1, 3]) == [1, 3, 1, 3], "1st example"
assert checkio([1, 2, 3, 4, 5]) == [], "2nd example"
assert checkio([5, 5, 5, 5, 5]) == [5, 5, 5, 5, 5], "3rd example"
assert checkio([10, 9, 10, 10, 9, 8]) == [10, 9, 10, 10, 9], "4th example"

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

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

#Some hints
#You can use list.count(element) method for counting.
#Create new list with non-unique elements
#or remove elements from original list (but it's bad practice for many real cases)
#Loop over original list

#These "asserts" using only for self-checking and not necessary for auto-testing
if __name__ == "__main__":
assert isinstance(checkio([1]), list), "The result must be a list"
assert checkio([1, 2, 3, 1, 3]) == [1, 3, 1, 3], "1st example"
assert checkio([1, 2, 3, 4, 5]) == [], "2nd example"
assert checkio([5, 5, 5, 5, 5]) == [5, 5, 5, 5, 5], "3rd example"
assert checkio([10, 9, 10, 10, 9, 8]) == [10, 9, 10, 10, 9], "4th example"