Contains Duplicate leetcode
2015-10-25 22:55
501 查看
easy problem
public class Solution { public boolean containsDuplicate(int[] nums) { if(nums.length<2) return false; Arrays.sort(nums); for(int i = 1;i<nums.length;i++) { if(nums[i]==nums[i-1]) return true; } return false; } }
相关文章推荐
- 基于Theano的深度学习(Deep Learning)框架Keras学习随笔-19-Containers
- Mountain Road
- 初窥Windows Server Container
- Paint
- HDU 3268 Columbus’s bargain
- HDU1039-Easier Done Than Said?(字符串处理)
- HDU 3264 Open-air shopping malls
- 怎么理解int main(int argc, const char *argv[])
- Daily Scrumming* 2015.10.24(Day 5)
- Daily Scrumming 2015.10.23(Day 4)
- Daily Scrumming 2015.10.22(Day 3)
- main()与_tmain()区别
- Daily Scrumming 2015.10.21(Day 2)
- Daily Scrumming 2015.10.20(Day 1)
- 关于使用AIDL出现空指针的解决办法
- pat 1014 Waiting in Line (30)
- 最简实例说明wait、notify、notifyAll的使用方法
- AIDL简单使用
- poj 1273 Drainage Ditches【最大流入门】
- bzoj3540【Usaco2014 Open】Fair Photography