LeetCode-TwoSum
来源:互联网 发布:iphone主题软件下载 编辑:程序博客网 时间:2024/06/15 00:54
题目描述:
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.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].本题考虑用Hash来解,代码如下:
public class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
for(int i = 0;i<nums.length;i++){
map.put(nums[i],i); //将读入的数据加入到map中
}
int index1 = 0;
int index2 = 0;
for(int i = 0;i < nums.length;i++){
index1 = i;
int find = target - nums[index1];
if(map.get(find) != null && map.get(find) != index1){ //判断是否满足条件
index2 = map.get(find); //满足条件将该值赋给index2
break;
}
}
int[] res = new int[2];
res[0] = index1<index2?index1:index2;
res[1] = index1>index2?index1:index2;
return res; //返回两个元素的下标,下标从1开始
}
}
- [leetcode]-twoSum
- [leetcode]twoSum
- LeetCode-TwoSum
- 【Leetcode】TwoSum
- LeetCode - TwoSum
- leetcode :twoSum
- leetcode TwoSum
- leetcode twosum
- leetcode--twoSum
- LeetCode twoSum
- LeetCode-TwoSum
- leetcode--twoSum
- leetcode TwoSum
- TwoSum leetcode
- leetcode:twosum
- leetcode:TwoSum
- LeetCode---TwoSum
- LeetCode-TwoSum
- windows下文件共享以及通过网线在两台Windows电脑之间传数据
- Task schedule
- Linux--网络基础
- tjut 3948
- 10+ 最佳的 Node.js 教程和实例
- LeetCode-TwoSum
- #pragma once与#ifndef两种防止头文件二次编译的区别
- C语言练习
- 字符串按照多个字符分割
- 关于myBatis
- 《PCL点云库学习&VS2010(X64)》Part 19 PCL1.72(VTK6.2.0)PCL程序计时
- mybatis:方法需要传入多个参数时,报错:Caused by: org.apache.ibatis.binding.BindingException: Parameter 'p_v_id' not
- Linux--网络基础CCNA
- 浅谈java 中static关键字。