Add to List 167. Two Sum II
来源:互联网 发布:天府商品交易软件 编辑:程序博客网 时间:2024/05/16 11:51
Given an array of integers that is already sorted in ascending order, 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 and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
class Solution { public int[] twoSum(int[] numbers, int target) { // step1: 将所有的数 存入到hashmap(字典)中去 //<K, V> ---> K one element of numbers, V is K's position in the array. HashMap<String, Integer> dic = new HashMap<String, Integer>(); for(int i = 0; i < numbers.length; ++i) { dic.put(numbers[i] + "", i + 1); } int [] res = new int[2]; // 开始搜索 int another; for (int i = 0; i < numbers.length; ++i) { another = (target - numbers[i]); // 存在两个数相同 if (another == numbers[i]) { if (i < numbers.length && another == numbers[i + 1]) { res[0] = i + 1; res[1] = i + 2; return res; } ++i; } if (dic.get(another + "") != null) { res[0] = i + 1; res[1] = dic.get(another+""); return res; } } return null; }}
学习笔记:
1. 这题并不难
有一点需要记住:有时数据探索使用二分法比hash快。
阅读全文
0 0
- Add to List 167. Two Sum II
- Leetcode--Add to List 371. Sum of Two Integers
- Add to List 371. Sum of Two Integers
- leetcode 113. Path Sum II Add to List
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- C语言实现身份证查询系统
- 做人,赢在格局 ,输在计较!
- 关于HTTP协议
- 虚拟内存(占坑)
- Android开发之获取手机通讯录
- Add to List 167. Two Sum II
- 数据库事务隔离级别
- 第十二篇:Bug管理系统UML2.0建模实例(四)
- nodejs安装
- sybase创建代理表
- lintcode:最后一个单词的长度
- Educational Codeforces Round 27
- zcmu-1901
- Too many classes in --main-dex-list, main dex capacity exceeded | 主Dex引用太多怎么办?