220. Contains Duplicate III set的应用
来源:互联网 发布:淘宝天猫交易额 编辑:程序博客网 时间:2024/06/06 02:22
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.
Subscribe to see which companies asked this question
分析:
在关系容器中有一类,set用来存可重复的的关系。
set有lower_bound(k)用来求不大于k的函数,以及upper_bound(k)用来求不小于k的的函数,很适合用来求此题。
注意代码若nums[i]与nums[j]不超过t,则nums[i]-nms[[j]<=t &&nums[j]-nums[i]<=t;
代码如下:
class Solution {
public:
bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
set<int> s1;
if(nums.size()<2 || k<1) return false;
for(int i=0;i<nums.size();++i)
{
if(i>k) s1.erase(nums[i-k-1]);
auto p=s1.lower_bound(nums[i]-t);
if(p!=s1.end()&& ((*p-nums[i])<=t)) return true;
s1.insert(nums[i]);
}
return false;
}
};
- 220. Contains Duplicate III set的应用
- leetcode 220. Contains Duplicate III TreeSet和SortedSet的应用
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- 220. Contains Duplicate III
- java笔记——io流
- 了解数据库
- 关于百度,google map的url api的调用
- ubuntu安装pip+python27+ipython+scrapy+zlib-及遇到的各种问题解决
- java二分法查找
- 220. Contains Duplicate III set的应用
- Codeforces 577B Modulo Sum 【多重背包】
- 分布式服务通讯
- 深度学习之caffe
- VMware虚拟linux系统时与主机共享文件夹
- 计算机常识
- PHP+Mysql+jQuery实现文件下载次数统计
- ubuntu-pip+python27+ipython-安装-及遇到的各种问题解决
- 态度