LeetCode 217:Contains Duplicate
2015-05-31 18:37
357 查看
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.
给定一个整形数组,从中找出是否存在重复元素。可以使用map来实现,遍历数组,每访问一个元素,看其是否在map中出现,如已出现过,则存在重复元素,如没有,则将元素加入到map中。
代码如下:
给定一个整形数组,从中找出是否存在重复元素。可以使用map来实现,遍历数组,每访问一个元素,看其是否在map中出现,如已出现过,则存在重复元素,如没有,则将元素加入到map中。
代码如下:
class Solution { public: bool containsDuplicate(vector<int>& nums) { map<int, int> int_map; for (int i = 0; i<nums.size(); i++) { if(int_map.count(nums[i])){ return true; } int_map.insert(pair<int, int>(nums[i], i)); } return false; } };
相关文章推荐
- SGU121 Bridges painting
- Internal Sorting: Straight insertion: Sorting by Insertion
- Internal Sorting: Cocktail-shaker sort: Sorting by Exchanging
- Windows 动态磁盘卷:简单卷、跨区卷 、带区卷 、镜像卷 、RAID5卷 相关配置操作
- Hadoop: Hadoop oozie main sub workflow.xml configuration
- signal raise alarm用法
- Internal Sorting: Straight selection sort: Sorting by Selection
- solr DataImportHandler (数据相关操作)
- [leetcode] Contains Duplicate II
- [leedcode219]Contains Duplicate II
- SGU119 Magic Pairs
- Internal Sorting: Straight Two-way Merge Sort: Sorting by Merging
- 535 Error:authentication failed
- Searching: Chained Hash Table Search And Insertion-1
- Searching: Chained Hash Table Search And Insertion-2
- uvalive 6886 Flowery Trails fft
- LeetCode Contains Duplicate
- LeetCode Contains Duplicate II
- #172 Factorial Trailing Zeroes
- AI初级模型