leetcode:Two Sum
来源:互联网 发布:数据流算法 编辑:程序博客网 时间:2024/06/06 13:59
刷leetcode脑补算法+数据结构 参考:九章
public class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer, Integer> map=new HashMap<Integer, Integer>();
for(int i=0;i<nums.length;i++){
if (map.get(nums[i])!=null) {
int[] result={map.get(nums[i]),i};
return result;
}
map.put(target-nums[i], i);
}
int[] result={-1,-1};
return result;
}
}
原理:hashmap中存放<target-num[i],i>遍历数组,查找hashmap中是否存在key等于该数组元素,如果有,key对应的value以及当前数组元素下标即结果
0 0
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- leetcode之Two Sum
- LeetCode | Two Sum
- 九度题目1439Least Common Multiple
- Android init.rc文件解析
- 演化理解 Android 异步加载图片
- ES优质资料收集
- bzoj 1706 奶牛接力 矩阵乘法
- leetcode:Two Sum
- 算法训练 拦截导弹
- C++虚函数接口类
- C++成员函数的重载、覆盖与隐藏详解
- 信息技术快速上手教程
- C++之:模板元编程(一)
- 获取View的宽高信息
- 摇一摇
- 线程进程对形象理解