[LeetCode] No.1 Two Sum

“做程序员太辛苦了，我想换行……我该怎么办？”

“敲一下回车。”

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,M1_TwoSum
return [0, 1]

 

解法

• 输入一个数组，还有一个目标数target，找到数组中存在的两个数，使之和为target。
• 解法一：爆破，直接嵌套循环遍历数组然后判断即可。
• 解法二：使用HaspMap，以键值对的形式，遍历→判断→存储。

import java.util.Arrays;
import java.util.HashMap;



public class M1_TwoSum {
	
	/**
	 * 
	 * 爆破解法
	 * 双重for循环遍历
	 * 
	 * */
	public int[] twoSum_0(int[] nums, int target) {
	    for (int i = 0; i &l