217. Contains Duplicate
2016-03-14 13:14
375 查看
#include<algorithm> class Solution { public: bool containsDuplicate(vector<int>& nums) { if(nums.size()<=1) return false; sort(nums.begin(),nums.end()); for(auto a=nums.begin();a!=nums.end()-1;a++) if(*a==*(a+1)) return true; return false; } };
相关文章推荐
- 172. Factorial Trailing Zeroes
- 70. Climbing Stairs
- Leetcode 11. Container With Most Water
- Kafka High Availability
- 苹果Macbook Air怎么安装Win7系统图解教程(图)
- 我的思考,我的科技漫谈——人工智能
- 11 Container With Most Water
- Exception in thread "main" org.hibernate.HibernateException: save is not valid without active transaction
- pku3317 Stake Your Claim 极大极小搜索+状压+AB剪枝
- 图灵机器人——人工智能聊天服务
- AI设计的若干规则阐述
- Available Memory Is Low
- wait()函数,waitpid()函数
- Unix Study之--AIX6.1 Install hacmp6.1
- Unix Study之--AIX6.1 Install hacmp6.1
- Genymotion 提示 failed to import ova file
- 11. Container With Most Water
- 谈谈人工智能、围棋与数学
- Tomcat启动过程(三):从SocketProcessor到Container
- 揭秘AlphaGo背后团队:人工智能的下一个目标是什么?