leecode algo1: Two Sum (Java)
来源:互联网 发布:数控铣床编程卡通图案 编辑:程序博客网 时间:2024/05/21 12:46
leecode algo1: Two Sum
题目:
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
具体实现如下(leetcode 提交通过, Run Time:7ms):
package algo1;import java.util.HashMap;public class Solution {public static void main(String[] args) {Solution s = new Solution();int[] nums = {2, 1, 9, 4, 4, 56, 90, 3};int[] res = s.twoSum(nums, 8);System.out.println(res[0] + "\t" + res[1]);}public int[] twoSum(int[] nums, int target) {HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();for(int i = nums.length - 1; i > 0; i--) {if(target == nums[i] * 2) {if(map.containsKey(nums[i])) {int[] res = new int[2];res[0] = i + 1;res[1] = map.get(nums[i]) + 1;return res;} else {map.put(nums[i], i);}} else {map.put(nums[i], i);}}for(int i = 0; i < nums.length; i++) {if(map.containsKey(target - nums[i])) {int[] res = new int[2];res[0] = i + 1;res[1] = map.get(target - nums[i]) + 1;return res;}}return null;}}
0 0
- leecode algo1: Two Sum (Java)
- LeeCode--Two Sum
- LeeCode-Two Sum
- leecode(1)Two Sum
- Leecode 刷题1 Two Sum
- leecode 第一题 TWO SUM
- LeeCode编程训练日记一:Two Sum
- Combination Sum III Leecode Java
- leecode algo2: Add Two Numbers (Java)
- [leecode 170] Two Sum III - Data structure design
- leecode 167. Two Sum II - Input array is sorted
- LeetCode: Two Sum (Java)
- [Leetcode] Two Sum (Java)
- Two Sum Java
- 【Leetcode】two sum JAVA
- Two Sum (Java)
- LeetCode java Two Sum
- Two Sum leetcode Java
- 软件开发(9):C语言中的大括号
- jdk安装及环境变量设置
- Linux内核工程导论——硬件:音频子系统
- git安装步骤
- C++实现一个类只有一个实例对象
- leecode algo1: Two Sum (Java)
- 软件开发(10):字符串处理函数及异常保护
- [NOIP2014]寻找道路 D2 T2
- 京东构建需求响应式亿级商品详情页技术分析
- Linux内核工程导论——硬件:无线子系统
- 动态联编
- 黑马程序员---OC学习笔记之常见结构体
- leetcode 20:Valid Parentheses(15-10-8)
- 二维码