Leetcode 220. Contains Duplicate III (Medium) (cpp)
来源:互联网 发布:vb自动更新登陆器源码 编辑:程序博客网 时间:2024/05/19 20:21
Leetcode 220. Contains Duplicate III (Medium) (cpp)
Tag: Binary Search Tree
Difficulty: Medium
/*220. Contains Duplicate III (Medium)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] and nums[j] is at most t and the difference between i and j is at most k.*/class Solution {public: bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) { if (nums.size() < 2) return false; vector<pair<long, int>> withIndex; for(int i = 0; i < nums.size(); i++) withIndex.emplace_back(nums[i], i); sort(withIndex.begin(), withIndex.end(), [](const pair<long, int>& a, const pair<long, int>&b) { return a.first<b.first; }); for(int i = 0; i < nums.size(); i++) { int j = i + 1; while(j < nums.size()) { if(withIndex[j].first - withIndex[i].first > t) break; if(abs(withIndex[j].second-withIndex[i].second) <= k) return true; j++; } } return false; }};
0 0
- Leetcode 220. Contains Duplicate III (Medium) (cpp)
- 220.leetcode Contains Duplicate III (medium)[]
- leetcode -- Contains Duplicate III -- 重点,medium题目
- leetcode 日经贴,Cpp code -Contains Duplicate III
- 220. Contains Duplicate III—medium
- [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]220. Contains Duplicate III
- #leetcode#220. Contains Duplicate III
- ARCH-LINUX 安装后wifi 不能联网修改
- 第五周 项目1-建立顺序栈算法库
- 学习C语言入门心得笔记
- 操作系统
- ==和equals的区别
- Leetcode 220. Contains Duplicate III (Medium) (cpp)
- Java并发编程学习笔记(一)
- 【时光回溯】【JZOJ3566】【GDKOI2014】阶乘
- 纯虚函数和抽象类
- 毛诗歌 一首
- 排序二叉树变为双向链表
- 第四周摄氏度转换华氏度
- 修改hosts进入google世界
- IO流-输入与输出