LeetCode之Find All Numbers Disappeared in an Array

1、题目

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]

Input:

[0]

Output:

[1]

2、代码实现

public class Solution {public List<Integer> findDisappearedNumbers(int[] nums) {List<Integer> list = new ArrayList<Integer>();if (nums == null || nums.length == 0)return list;Map<Integer, Integer> map = new HashMap<Integer, Integer>();for (int  i = 0;  i < nums.length; ++i) {map.put(nums[i], 2);}for (int i = 1; i <= nums.length; ++i) {Integer in = map.get(i);if (in == null) { list.add(i);}}return list;}
}

3、总结

当我们需要找到数组集合里面没有包含哪个元素的时候，我们可以采用HashMap来解决这个问题
比如｛1， 2，4， 2， 5｝
还有就是找2个字符串里面第一个不重复元素的问题,我们可以采用HashMap来解决这个问题

s = "leetcode"
return 0.
s = "loveleetcode",
return 2.

或者找字符数组里面唯一一个重复的字符都可以采用HashMap来解决这个问题

LeetCode之Find All Numbers Disappeared in an Array相关推荐

Leetcode 448. Find All Numbers Disappeared in an Array
Leetcode 448. Find All Numbers Disappeared in an Array Add to List Description Submission Solutions ...
LeetCode 448. Find All Numbers Disappeared in an Array 442. Find All Duplicates in an Array
这两道题很有意思,由于元素为1~n,因此每个元素的值-1(映射到0~n-1)就可以直接当做下标.这样将 nums 中对应下标的元素 *-1 以i表示 index+1 这个元素出现过了,能节省存储的空间 ...
leetcode 448. Find All Numbers Disappeared in an Array | 448. 找到所有数组中消失的数字（原地，位运算）
题目 https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/ 题解遍历数组,将数组中每个数字 n 作为下标,将 ...
leetcode 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
[swift] LeetCode 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
Find All Numbers Disappeared in an Array
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others ...
[LeetCode] Find All Numbers Disappeared in an Array 找出数组中所有消失的数字
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
C#LeetCode刷题之#448-找到所有数组中消失的数字（Find All Numbers Disappeared in an Array）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3712 访问. 给定一个范围在 1 ≤ a[i] ≤ n ( n ...
LeetCode Find All Numbers Disappeared in an Array
题意:给出长度为n的数组,数组的数为 1-n,找出没有出现的数思路:在遍历数组时,将对应的索引的数设置为负数.第二次遍历数组时,索引所在的数为正数,说明是没有出现的代码如下: public cla ...

LeetCode之Find All Numbers Disappeared in an Array

1、题目

2、代码实现

3、总结

LeetCode之Find All Numbers Disappeared in an Array相关推荐

最新文章

热门文章