[leetcode] 217. Contains Duplicate
2016-05-30 10:17
435 查看
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.
Solution:
Idea: sort numbers first, and than check consecutive elements. However, the complexity of sorting depends on sorting algorithm.
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
if (nums.size() == 0)
return false;
sort(nums.begin(),nums.end());
int valmax = nums[nums.size()-1];
for (int i = 0; i < nums.size() -1; i++){
if ((nums[i] - nums[i+1])==0)
return true;
}
return false;
}
};
twice in the array, and it should return false if every element is distinct.
Solution:
Idea: sort numbers first, and than check consecutive elements. However, the complexity of sorting depends on sorting algorithm.
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
if (nums.size() == 0)
return false;
sort(nums.begin(),nums.end());
int valmax = nums[nums.size()-1];
for (int i = 0; i < nums.size() -1; i++){
if ((nums[i] - nums[i+1])==0)
return true;
}
return false;
}
};
相关文章推荐
- RM格式压缩电影软件 Easy RealMedia Producer Full V1.94 下载
- 在IE 浏览器中使用 jquery的fadeIn() 效果 英文字符字体加粗
- 比较简单的jquery教程 Easy Ajax with jQuery 中文版全集第1/3页
- Easy RM RMVB to DVD Burner v1.3.8 汉化版 下载 附注册码
- Expandable "Detail" Table Rows
- linux下安装easy_install的方法
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- 归纳整理文件Easy Duplicate Finder2.24 破解版
- DM*** and Easy *** Server with ISAKMP Profiles
- easy ***
- cisco packet tracer 5.3 实现基于3A的easy ***
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum