leetcode219[easy]----Contains Duplicate II
来源:互联网 发布:数据库系统设计 编辑:程序博客网 时间:2024/05/18 15:54
难度:easy
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
思路:找到array中是否存在两个数,这两个数相同,且index之差小于或等于K。
无数惨痛教训证明用双循环肯定是找死,一定会超时。
把nums中的每个element转变为dict的key,index转化为dict的value。
此题要注意这样的例子:[1,0,2,1,1,4] ,k=1,要排除掉array转dict时,数值相同,但是两个数的index相差大于k的情况。
阅读全文
0 0
- leetcode219[easy]----Contains Duplicate II
- LeetCode219:Contains Duplicate II
- leetcode219---Contains Duplicate II
- leetcode219. Contains Duplicate II
- LeetCode219. Contains Duplicate II
- Leetcode219. Contains Duplicate II
- leetcode219~Contains Duplicate II
- leetcode219. Contains Duplicate II
- LeetCode219题:Contains Duplicate II
- LeetCode219——Contains Duplicate II
- Leetcode219. Contains Duplicate II(重新修改)
- hash去重及应用-【leetcode219-Contains Duplicate II】
- [Leetcode 219, Easy] Contains Duplicate II
- Easy-题目41:219. Contains Duplicate II
- 219. Contains Duplicate II [easy] (Python)
- Leetcode 219. Contains Duplicate II (Easy) (cpp)
- Easy 219题 Contains Duplicate II
- Contains Duplicate && Contains Duplicate II
- SQLServer批量插数据
- 拼写错误检测(动态规划法)
- VL6180X传感器驱动
- 使用Visual Studio Code,.net Core 2.0进行CodeFirst
- TCP/IP 5层协议
- leetcode219[easy]----Contains Duplicate II
- numpy的基本操作
- vue-router相同的地址,如何刷新数据
- Part itemtype解读(2): RelationshipType
- Android下使用Protobuf进行序列化
- 《Apache Flume教程》第四章 Flume数据库数据流
- Quartz入门
- gulp配置文件
- 细说mysql索引