数据结构--筛选数组中重复的元素

python版

def duplicates(arr):
	dup = []
	dic = {}
	for i in arr:
		if i in dic:
			dic[i] = dic[i] + 1
		else:
			dic[i] = 1
	for k, v in dic.items():
		if v > 1:
			dup.append(k)
	return dup

java版

ArrayList<Integer> notRepeatingNum(int [] nums)
{
	ArrayList<Integer> ret = new ArrayList<>();
	Map<Integer, Integer> map = new HashMap<>();
	for(int i = 0; i < nums.length; i++)
	{
		if(map.containsKey(nums[i]))
		{
			map.put(nums[i], map.get(nums[i]) + 1);
		}
		else
		{
			map.put(nums[i], 1);
		}
	}
	for(Integer num : map.keySet())
	{
		if(map.get(num) == 1)
		{
			ret.add(num);
		}
	}
	return ret;
}