/
githubmirror
/
interviews
Обзор
Документация
Войти
/
githubmirror
/
interviews
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
leetcode/array/FindAllNumbersDisappearedInAnArray.java
37 строк
1 KB
Kevin Naughton Jr
added FindAllNumbersDisappearedInAnArray.java
04 июн 2018, 04:58
04 июн 2018, 04:58
fbbb6db
Код
Авторство
О чём код?
//Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. // //Find all the elements of [1, n] inclusive that do not appear in this array. // //Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space. // //Example: // //Input: //[4,3,2,7,8,2,3,1] // //Output: //[5,6] class FindAllNumbersDisappearedInAnArray { public List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> result = new ArrayList<Integer>(); HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); for(int i = 1; i <= nums.length; i++) { map.put(i, 1); } for(int i = 0; i < nums.length; i++) { if(map.containsKey(nums[i])) { map.put(nums[i], -1); } } for(int i: map.keySet()) { if(map.get(i) != -1) { result.add(i); } } return result; } }