【LeetCode】#1两数之和(Two Sum)

【LeetCode】#1两数之和(Two Sum)

题目描述

给定一个整数数组nums和一个目标值target，请你在该数组中找出和为目标值的两个整数。
你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。

示例

给定nums = [2, 7, 11, 15], target = 9
因为nums[0] + nums[1] = 2 + 7 = 9
所以返回[0, 1]

Description

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].

解法

解法1：

class Solution{
	public int[] twoSum(int[] nums, int target){
		int[] res = new int[2];
		for(int i=0; i<nums.length; i++){
			int one = nums[i];
			int k = -1;
			int two = target - one;
			for(int j=i+1; j<nums.length; j++){
				if(nums[j]==two){
					k = j;
					break;
				}
			}
			if(k != -1){
				res[0] = i;
				res[1] = k;
				return res;
			}
		}
		return null;
	}
}

解法2：

class Solution{
	public int[] twoSum(int[] nums, int target){
		int[] res = new int[2];
		Map<Integer, Integer> map = new HashMap<>();
		for(int i=0; i<nums.length; i++){
			if(map.containsKey(target-nums[i])){
				if(map.get(target-nums[i]) != i){
					res[0] = map.get(target - nums[i]);
					res[1] = i;
					return res;
				}
			}
			map.put(nums[i], i);
		}
		return null;
	}
}