Leetcode Problem.217 —Contains Duplicate
2015-06-03 15:41
369 查看
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.
My C++ solution!
twice in the array, and it should return false if every element is distinct.
My C++ solution!
bool containsDuplicate(vector<int>& nums) { if(nums.size()==0) return false; sort(nums.begin(),nums.end()); for(int i=0;i<nums.size()-1;i++) if(nums[i]==nums[i+1]) return true; return false; }
相关文章推荐
- 使用NSSearchPathForDirectoriesInDomains等获取路径的方法时的注意事项
- tools:context=".MainActivity的作用
- AIX下新建账户
- 控制台应用程序的Main方法
- * failed to start daemon *
- KVM 介绍(3):I/O 全虚拟化和准虚拟化 [KVM I/O QEMU Full-Virtualizaiton Para-virtualization]
- VS2010调试 --指南 Reference from : http://blog.csdn.net/kingzone_2008/article/details/8133048
- Main函数中参数argc,argv说明
- MFC单文档工程的使用小结(CDocument, CView, CMainFrame)
- LeetCode: Contains Duplicate
- Onpaint()函数中绘图出现问题:当多次进入onpaint()发现次数达到一定程度就会出现窗口不能再重绘导致窗口内容损坏的现象
- AIDL机制实现进程间的通讯实例
- storyboard plain style unsupported in a navigation item
- document.domain 跨域问题
- [Leetcode 217, Easy] Contains Duplicate
- [Leetcode 219, Easy] Contains Duplicate II
- sendMail 发邮件 tls
- 【安卓学习之路1】轻轻一点,好神奇——给activity_main.xml添加Button控件
- URAL 1152 Faise Mirrors 状压DP 简单题
- Container With Most Water