LeetCode 220 Contains Duplicate III
来源:互联网 发布:怎样应聘淘宝模特 编辑:程序博客网 时间:2024/05/22 06:34
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] andnums[j] is at most t and the difference between i andj is at most k.
题目要求:数组nums中,是否存在i, j,满足abs(nums[i]-nums[j]) <= t, abs(i-j) <= k。
使用了set对问题进行求解。
class Solution {public: bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) { if(t<0 || k<0 || nums.size()<2) return false; set<int> s; for(int i = 0; i < nums.size(); i++){ if(i > k) s.erase(nums[i-k-1]); set<int>::iterator it = s.lower_bound(nums[i]-t); if(it != s.end() && abs(*it - nums[i]) <= t) return true; s.insert(nums[i]);} return false; }};
在完成了III之后,又把I和II做了。有了III的基础,I和II很容易就解决了。
0 0
- Contains Duplicate III - LeetCode 220
- leetcode 220: Contains Duplicate III
- Leetcode 220 Contains Duplicate III
- leetcode #220 Contains Duplicate III
- LeetCode(220) Contains Duplicate III
- leetcode 220: Contains Duplicate III
- [leetcode 220]Contains Duplicate III
- [LeetCode 220] Contains Duplicate III
- leetcode 220 Contains Duplicate III
- 【LEETCODE】220-Contains Duplicate III
- LeetCode 220 Contains Duplicate III
- LeetCode 220 Contains Duplicate III
- leetcode-Contains Duplicate III-220
- LeetCode 220 Contains Duplicate III
- leetcode - Contains Duplicate III
- [leetcode] Contains Duplicate III
- LeetCode Contains Duplicate III
- LeetCode Contains Duplicate III
- range和xrange
- Linux下安装星际翻译
- 虚惊一场——VirtualBox双击没反应
- 网络的几种存储方式:DAS、NAS、SAN、ISCSI的区别
- Android Studio 百度地图 230错误 Scode码校验失败
- LeetCode 220 Contains Duplicate III
- 元数据相关知识
- 那些我曾踩过的坑之类型显式/隐式转换
- 项目 4 - 顺序串算法(2)
- iOS开发 pod管理项目,多个target管理的Podfile的写法
- 理解离散傅立叶变换(三.复数)
- Android Uri解析
- Java常用排序算法/程序员必须掌握的8大排序算法
- GreenDao3.0简单使用和升级