LeetCode之Missing Number
【摘要】 1、题目
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
For example, Given nums = [0, ...
1、题目
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3] return 2.
Given nums =
[0] return 1
2、代码实现
-
public class Solution {
-
public int missingNumber(int[] nums) {
-
if (nums == null) {
-
return 0;
-
}
-
int result = 0;
-
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
-
for (int i = 0; i < nums.length; ++i) {
-
map.put(nums[i], 2);
-
}
-
for (int i = 0; i <= nums.length; ++i) {
-
Integer in = map.get(i);
-
if (in == null) {
-
return i;
-
}
-
}
-
return result;
-
}
-
}
3、注意的地方
这个地方需要注意
-
for (int i = 0; i <= nums.length; ++i) {
-
Integer in = map.get(i);
-
if (in == null) {
-
return i;
-
}
-
}
文章来源: chenyu.blog.csdn.net，作者：chen.yu，版权归原作者所有，如需转载，请联系作者。
原文链接：chenyu.blog.csdn.net/article/details/68061218
【版权声明】本文为华为云社区用户转载文章，如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）