## [Python] Checkio Solution 解答 – Non-Unique Elements

架網編程

### Problem:

You are given a non-empty list of integers (X). For this task, you should return a list consisting of only the non-unique elements in this list. To do so you will need to remove all unique elements (elements which are contained in a given list only once). When solving this task, do not change the order of the list. Example: [1, 2, 3, 1, 3] 1 and 3 non-unique elements and result will be [1, 3, 1, 3].

### Level:

Elementary

### Input:

A list of integers.

### Output:

The list of integers.

### How it is used:

This mission will help you to understand how to manipulate arrays, something that is the basis for solving more complex tasks. The concept can be easily generalized for real world tasks. For example: if you need to clarify statistics by removing low frequency elements (noise).

### Precondition:

0 < len(data) < 1000

*Source: https://py.checkio.org*

### My Solution:

```
def checkio(data):
i = 0
while i != len(data):
if data.count(data[i]) == 1:
data.remove(data[i])
else:
i = i+1
return data
```

### Comment:

Before I started my beginner Python course, I had no clues on how to solve this problem. However, after a few lessons, this kind of problems were actually quite easy to solve. Comparing to my first problem on Checkio, this solution is much shorter.

發佈日期：2017年9月9日 | 作者：橘小佑