Leetcode#1-Two Sum
来源:互联网 发布:2016成都程序员工资 编辑:程序博客网 时间:2024/06/04 19:20
Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
solution:
class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>();//声明hash map,名字叫做map for(int i = 0; i < nums.length; i++){ //用for循环把nums里的键值对加入到map中 map.put(nums[i], i); //用.put函数执行加入操作 } for(int i = 0; i < nums.length; i++){//用for循环检查键值对是否在map中存在 int complement = target - nums[i]; if(map.containsKey(complement) && map.get(complement) != i){//Beware that the complement must not be nums[i]itself! //比如[2,2,5],target = 4,此时2的index可以是0也可以是1,i就会有问题。所以为了避免重复,complement的index必须不是nums[i]的index. //用.comtainsKey函数检查是否complement在map中存在.用.get获取complement的索引值。 return new int[] {i, map.get(complement)};//return新的指定数组,用new int[]{a, b}; } } throw new IllegalArgumentException("No two sum solution");//异常处理,throw new IllegalArgumentException}}
阅读全文
0 0
- LeetCode 1 - Two Sum
- leetcode 1 Two Sum
- Leetcode【1】:Two Sum
- [leetcode 1] Two Sum
- 【leetcode-1】Two Sum
- [leetcode 1] Two Sum
- [Leetcode] 1 - Two Sum
- LeetCode (1) Two Sum
- LeetCode 1:《Two Sum》
- LeetCode | #1 Two Sum
- leetcode-1 Two Sum
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- leetcode 1:Two Sum
- LeetCode 1 Two Sum
- leetcode #1 two sum
- KNN
- 693. Binary Number with Alternating Bits
- JSP--Java server Pages
- 695. Max Area of Island
- ubuntu下安装pcl
- Leetcode#1-Two Sum
- Java并发编程:volatile关键字解析
- 算法基础-枚举-编程题#1: 画家问题
- 欲修炼成架构师,必先……
- Random Forest
- Python 的错误、调试和测试
- thinkphp5 phpexcel导出导入
- 047 中值定理之型四(ξ η复杂度不同,留复杂中值项);型五泰勒公式之核心关键取x0,x
- 【codevs 1008】选数