LeetCode 001 Two Sum
来源:互联网 发布:混音软件 编辑:程序博客网 时间:2024/05/16 05:34
题目描述
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
代码
public static int[] twoSum(int[] nums, int target) { if (nums == null || nums.length == 0 || nums.length == 1) { return new int[2]; } Map<Integer, Integer> map = new HashMap<Integer, Integer>(); // key为target - nums[i],不用担心重复,题目说明只有一个解 for (int i = 0; i < nums.length; i++) { map.put(target - nums[i], i); } for (int i = 0; i < nums.length; i++) { Integer v = map.get(nums[i]); // 元素不能使用自身 if (v != null && v != i) { return new int[] { i + 1, v + 1 }; } } return null; }
1 0
- LeetCode 001 Two Sum
- LeetCode-001 Two Sum
- 【leetcode】001 Two Sum
- LeetCode 001-Two Sum
- [LeetCode]-001-Two Sum
- LeetCode 001, Two Sum
- LeetCode 001 Two Sum
- 001 Two Sum [Leetcode]
- LeetCode #001 Two Sum
- LeetCode 001 Two Sum
- 【leetCode】001Two Sum
- LeetCode || 001 Two Sum
- 【Leetcode】001 Two Sum
- LeetCode-001 Two Sum
- LeetCode 001 :Two Sum
- leetcode 001 Two Sum
- 【leetcode 001】Two Sum || Add Two Numbers
- [LeetCode题解001]Two Sum
- 田忌赛马 364nyoj
- 配置bower组件保存位置
- Linux和Windows下ping
- 屏幕适配
- 矩阵/向量迭代算法:PageRank, HITS, SPEAR
- LeetCode 001 Two Sum
- ArcGIS GP Statistics工具使用
- shell 脚本完成对日志文件的提取之awk 学习
- [46]Permutations
- 1 answer for 8 queens problem
- Xcode调试技巧
- jsp和servlet的区别和联系
- 如何修改远程桌面的端口号以及修改远程桌面端口的软件
- python和java语言的区别