算法作业HW29:LeetCode 219. Contains Duplicate II
来源:互联网 发布:linux gcc 版本 编辑:程序博客网 时间:2024/06/03 22:01
Description:
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array
Note:
such that nums[i] = nums[j] and the absolute difference between i and j is at most k.Solution:
Analysis and Thinking:
题目要求给出一个整数数组的情况下,判断该数组内是否有相等的元素值,要求索引相差不大于K,依据题意,借助map的结构就可完成
Steps:
1. 定义一个map,用于记录当前关键字和下标值
2. 遍历数组,用map统计当前元素在map中的出现个数,如果不为0(证明已经出现过)且其记录的value即该元素下标与当前下标相减的绝对值小于等于k,返回true
3. 如果出现次数为0,将该元素以及对应下标添加入map中
Codes:
bool containsNearbyDuplicate(vector<int>& nums, int k) { if(nums.size()<=1) return false; if(k<-0) return false; map<int,int> record; for(int i=0;i<nums.size();i++) { if(record.count(nums[i]) && abs(record[nums[i]]-i)<=k) { return true; } else { record[nums[i]] = i; } } return false; }
Results:
阅读全文
0 0
- 算法作业HW29:LeetCode 219. Contains Duplicate II
- [leetcode] 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- LeetCode:219. Contains Duplicate II
- 【Leetcode】219. Contains Duplicate II
- Leetcode 219. Contains Duplicate II
- 219. Contains Duplicate II LeetCode
- 【LeetCode】219. Contains Duplicate II
- Leetcode 219. Contains Duplicate II
- LeetCode *** 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- leetcode 219. Contains Duplicate II
- 219.[Leetcode]Contains Duplicate II
- Leetcode 219. Contains Duplicate II
- 【leetcode】219. Contains Duplicate II
- LeetCode - 219. Contains Duplicate II
- MapReduce生成HFile入库到HBase
- 查询所有重复字段的sql
- CSS基础-浮动流 15
- LeetCode49 Group Anagrams
- HTML学习笔记
- 算法作业HW29:LeetCode 219. Contains Duplicate II
- 认识HTML5的WebSocket
- OpenCV 2.4.9核心模块介绍
- 5-2 A-B (20分)
- 1277. 最高的奶牛 (Standard IO)
- Spring MVC分组校验
- java开发——servlet作用域
- openflowjava的hello消息
- POJ 2901 Hotel 笔记