217. Contains Duplicate
2016-08-23 17:21
253 查看
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.
思路:
排序之后比较是否前后一样(最快)
思路:
存到set中去重,比较前后的数组大小
思路:
排序之后比较是否前后一样(最快)
public boolean containsDuplicate(int[] nums) { if (nums.length <= 1) return false; Arrays.sort(nums); for (int i = 1; i < nums.length; i++) { if (nums[i] == nums[i - 1]) return true; } return false; }
思路:
存到set中去重,比较前后的数组大小
public static boolean containsDuplicate(int[] nums) { Set set = new HashSet<Integer>(); for (int i = 0; i < nums.length; i++) { set.add(nums[i]); } return set.size() < nums.length ? true : false; }在过程中判断contains反而会变慢。。。。
相关文章推荐
- Head First C# 中文版 图文皆译 第六章 继承 page217
- rqnoj-217-拦截导弹-最长不上升子序列以及不上升子序列的个数
- 217 a letter and a number
- Leetcode_217_Contains Duplicate
- 201507010852_《Javascript权威指南(第六版)——判断值类型的type函数 、鸭式辩型》(P210-217)
- [C语言][LeetCode][217]Contains Duplicate
- LeetCode-Contains Duplicate 217
- Leetcode217: Reverse Nodes in k-Group
- 【leetcode】【217】Contains Duplicate
- leetcode 217 Contains Duplicate
- 80老翁谈人生(217):互联网耻辱柱牢靠不牢靠?
- 处理Account locked due to 217 failed logins的问题
- ISO 217打印纸标准
- 如何查找订单提示VPRS VE217 数量/值确定时出错
- OCP 1Z0 053 217
- LeetCode 217:Contains Duplicate
- Leetcode 217 Contains Duplicate
- 217 Contains Duplicate
- leetcode 217--Contains Duplicate
- [leetcode oj 217]Contains Duplicate