[leetcode]Contains Duplicate
2015-06-12 16:00
288 查看
Contains Duplicate
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.题意:给出一组整数,找出是否包含相同的数
class Solution { public: bool containsDuplicate(vector<int>& nums) { map<int, int> mii; for(int i = 0; i < nums.size(); i++){ mii[nums[i]]++; if(mii[nums[i]] > 1) return true; } return false; } };
相关文章推荐
- 安装apk时出现错误Failure [INSTALL_FAILED_DEXOPT]问题解决的方法
- 通过AIDL实现挂断电话功能
- 人工智能领域中声源定位的研究与发展------第二章 声源定位系统 (3)
- 不懂技术的人请不要对懂技术的人说这很容易
- 打包contrail-setup
- LeetCode 11 Container With Most Water
- $GetDomesticAirlinesTimeResult_type0@2bb5340c类错误
- HDOJ 1021 Fibonacci Again
- 十大经典数据挖掘算法(9) 朴素贝叶斯分类器 Naive Bayes
- leetcode之Contains Duplicate
- 大麦回忆录-maizuo开发
- Handler sendMessage 与 obtainMessage (sendToTarget)比较
- Leetcode220-Contains Duplicate III
- Compiler Error Message: The compiler failed with error code 128. 的问题解决
- http://blog.csdn.net/name_Uncle_Wang/article/details/46438641?ref=myread
- 出现set_locale() failed (5): Input/output error的解决方法
- scanf问题
- Climbing Stairs爬楼梯——动态规划
- 9 Ways to Instantly Strengthen Your Brain
- [POJ 1273] Drainage Ditches & 最大流Dinic模板