LeetCode01-two sum
来源:互联网 发布:穆雅斓的淘宝店斌斌 编辑:程序博客网 时间:2024/05/29 13:52
题目链接地址:https://leetcode.com/problems/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
题目解析:
思路一:采用遍历的方式对每一个元素相加得到target,时间复杂度O(n^2),但是采用java时,这种方法会超时。
思路二:用hashmap,将每个元素值作为key,数组索引作为value存入hashmap,然后遍历数组元素,在hashmap中寻找与之和为target的元素。 时间复杂度O(n),空间复杂度O(n)。
对于思路一,采用java时超时,不予采用
对于思路二,详细代码如下:
public static int[] twoSum2(int[] numbers, int target) { int[] index=new int[2]; HashMap<Integer, Integer> map=new HashMap<Integer, Integer>(); for(int i=0;i<numbers.length;i++){ if(!map.containsKey(numbers[i])){ map.put(target-numbers[i],i+1); System.out.println("numbers[i]:"+(target-numbers[i])+","+map.get(target-numbers[i])); }else{ System.out.println("numbers[i]:"+numbers[i]+","+map.get(numbers[i])); index[0]=map.get(numbers[i]); index[1]=i+1; System.out.println("index[0]"+index[0]); System.out.println("index[1]"+index[1]); } } return index; }
0 0
- LeetCode01-two sum
- LeetCode01:Two Sum
- LeetCode01 Two Sum
- leetcode01-Two Sum之beats99.47%Java版本
- leetcode01. Two SumII
- leetcode01 Two Sum 寻找列表中和为定值的元素位置
- Two Sum
- Two Sum
- Two Sum
- two sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- 算法提高 最大乘积 (排序+模拟+贪心)
- xamarin.forms 文件的一些操作,统一代码
- JavaScript语言标识符和保留字
- MM模块-MIGO收货后自动打印收货单
- 例题1.14 填充正方形 UVa11520
- LeetCode01-two sum
- xamarin.forms Settings Plugin 设置插件
- 什么是ACE?为什么它说是开发游戏服务器的利器?
- Mysql命令行导入sql数据
- JFinal中json的使用
- iOS 自动布局 Auto Layout 入门 06 详情页面 (c) 对左侧标签进行排版
- C语言基础用基本的循环语句打印实心和空心菱形、九九乘法表 .
- Android程序之全国天气预报查询(聚合数据开发)
- Valid Number