Leetcode 217. Contains Duplicate
2016-07-05 17:44
351 查看
题意：就是判断一个整数数组是否存在重复的元素，如果存在返回true，否则返回false
解题思路：采用hashmap方法，来遍历数组，如果map中存在该元素就返回，否则把该元素放入到map中。hashmap的查询复杂度为O（1）
代码：
public class Solution {
public boolean containsDuplicate(int[] nums) {
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
int len=nums.length;
for(int i=0; i< len; i++){
if(map.containsKey(nums[i])){
return true ;
}
map.put(nums[i],0);
}
return false;
}
}
解题思路：采用hashmap方法，来遍历数组，如果map中存在该元素就返回，否则把该元素放入到map中。hashmap的查询复杂度为O（1）
代码：
public class Solution {
public boolean containsDuplicate(int[] nums) {
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
int len=nums.length;
for(int i=0; i< len; i++){
if(map.containsKey(nums[i])){
return true ;
}
map.put(nums[i],0);
}
return false;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解