leetcode 1. Two Sum
2017-02-08 16:12
316 查看
题目
给定一个数组,和一个目标值,返回数组中两个和为目标值的下标,假设结果只有一个分析
使用hashMap存储数组元素值和下标,当map中含有target-num[i]的键时,说明已查找到。public int[] twoSum(int[] nums, int target) { int[] re=new int[2]; HashMap<Integer, Integer> map = new HashMap<>(); for(int i=0;i<nums.length;i++){ if(map.containsKey(target-nums[i])){ re[0]=map.get(target-nums[i]); re[1]=i; return re; }else{ map.put(nums[i], i); } } return re; }
相关文章推荐
- 【leetcode】001 Two Sum
- LeetCode(62)-Two Sum
- leetcode 1: 找出两个数相加等于给定数 two sum
- leetcode 刷题题解(c++) 1.Two Sum (hash表,排序+二分查找)
- LeetCode 学习笔记:Question 1、Two Sum
- LeetCode 1.Two Sum
- [leetcode]1. Two Sum
- Leetcode 之第一题 two sum
- LeetCode - Two Sum
- [LeetCode] Two Sum
- LeetCode:1. Two Sum
- [Leetcode] 1. Two Sum
- LeetCode_Two Sum
- leetcode 1 Two Sum
- [leetcode 1] Two Sum
- Leetcode学习(1)—— Two Sum
- 【闲来刷 leetcode】 Two Sum | leetcode OJ
- LeetCode:Algorith1 —Two Sum
- leetcode-1. Two Sum
- [Leetcode刷题]Two Sum