LeetCode-问题1-Two Sum
来源:互联网 发布:阿里云国际版如何购买 编辑:程序博客网 时间:2024/05/05 10:02
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].
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);
}
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);
break;
}
}
int[] res=new int[2];
res[0]=index1<index2?index1+1:index2+1;
res[1]=index1>index2?index1+1:index2+1;
return res;
}
}
0 0
- LeetCode-问题1-Two Sum
- LeetCode 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》
- LeetCode | #1 Two Sum
- leetcode-1 Two Sum
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- 初识Mybatis
- linux 可变参数va_* 和vprintf的使用
- torch.nn 小坑和疑惑
- 前端通用字典代码树源码(记录)
- jquery 放大镜
- LeetCode-问题1-Two Sum
- 域名原来是这么个东西
- (六)3中断下半部之工作队列
- 工作中常用的linux命令
- spice远控虚机时分辨率无法调整(spice-vdagent使用说明)
- Activity的生命周期和横竖屏切换的生命周期
- 应用层常用协议
- 小透明的Jmeter测试工具使用部分笔记 详情请看:http://jmeter.apache.org
- 测试端口