leetcode 1. Two Sum -----java
来源:互联网 发布:svn 3690端口怎么打开 编辑:程序博客网 时间:2024/05/16 04:06
题目链接:https://leetcode.com/problems/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.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].
解析:利用hashmap,key存放数值,value存放出现的位置。从前到后进行遍历,将target值减去当前的值,看是否存在map中,
若存在map中则取出相应的标号,退出。
java代码实现:
public class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
int result[] = new int[2];
for (int i = 0; i < nums.length; i++){
int num = target - nums[i];
if(map.containsKey(num)){
result[0] = map.get(num);
result[1] = i;
return result;
}
map.put(nums[i], i);
}
return result;
}
}
- [LeetCode java] 1.Two Sum
- LeetCode(java)1. Two Sum
- leetcode 1. Two Sum -----java
- (JAVA)LeetCode 1. Two Sum
- LeetCode 1. Two Sum(Java)
- [LeetCode] 1. Two Sum java
- leetcode 1. Two Sum -----java
- 1. Two Sum leetcode java
- LeetCode: Two Sum (Java)
- [Leetcode] Two Sum (Java)
- 【Leetcode】two sum JAVA
- LeetCode java Two Sum
- Two Sum leetcode Java
- [LeetCode][Java] Two Sum
- leetcode:Two Sum 【Java】
- LeetCode|Two Sum-java
- leetcode Two Sum(Java)
- leetcode-Java-1. Two Sum.java
- ubutntu系统语言更改
- Develog--Training系列(Building Your FirstApp 第一节)
- Android开发教程(十一)Activity周期
- 函数模板与类模板
- 第十六周上机实践项目5(2):小玩文件
- leetcode 1. Two Sum -----java
- c++实践参考:排序函数模板
- <welcome-file>index.action</welcome-file>直接设置action,404和struts2中的解决方案
- eclipse(折叠代码)
- NetRouter开发板之Websocket
- 内连接、左外连接、右外连接、交叉连接及其区别
- gitlab使用方法
- hdu 4995(枚举)
- vmware 使用过程死机,如何修复Ubuntu系统