LeetCode OJ 217.Contains Duplicate
2016-04-11 14:49
507 查看
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
这个问题比较简单,判断一个数组里的是否有重复出现的数字。代码简单如下:
这个问题比较简单,判断一个数组里的是否有重复出现的数字。代码简单如下:
public class Solution { public boolean containsDuplicate(int[] nums) { Map<Integer,Integer> map = new HashMap<>(0); for(int num : nums){ if(map.containsKey(num)) return true; map.put(num,0); } return false; } }
public class Solution { public boolean containsDuplicate(int[] nums) { if(nums == null || nums.length <= 1) return false; Set<Integer> set = new HashSet<>(); for(int num : nums) { if(!set.add(num)) return true; } return false; } }
相关文章推荐
- Failed reading log event, reconnecting to retry
- Markov Chain(bate)
- 关于 Gradle failed: already disposed module 的问题
- maertSataDmorfnaideMdniF.295
- ZOJ 3780 Paint the Grid Again-贪心模拟/拓扑排序
- AIDL
- 下一代机器学习-在浏览器中训练深度学习模型Next Generation Machine Learning - Training Deep Learning Models in a Browser
- trail particle制作血管
- leetcode 11 Container With Most Water
- Argument list too long: recursive header expansion failed at
- RAID知识讲解
- LeetCode 11. Container With Most Water
- LeetCode(43)-Contains Duplicate II
- LeetCode(43)-Contains Duplicate II
- LeetCode(43)-Contains Duplicate II
- 报错:failed to get the task for process XXX(解决方案)
- Domain generalization 简介
- BaiduMap---百度地图官方Demo之调用百度地图(介绍如何调启百度地图实现自身业务功能)
- Command /usr/bin/codesign failed with exit code 1
- jenkins排错---Waiting for next available executor