Two Sum（Java实现）

Two Sum（Java实现）

问题：

Given an array of integers nums and an integer target,return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution,and you may not use the same element twice.
You can return the answer in any order.

方法1：暴力法

public static int [] TowNumberSum_1(int []nums,int target)
    {
        for(int i=0;i<nums.length;i++)
        {
            for(int j=i+1;j<nums.length;j++){
                if(nums[i]+nums[j]==target){
                    return new int[]{i, j};
                }
            }
        }
       return null;
    }

方法2：哈希表法

public static int[] TowNumberSum_2(int [] nums,int target)
    {
        Map<Integer,Integer>map=new HashMap<>();
        for(int i=0;i<nums.length;i++)
        {
            if(map.containsKey(target-nums[i]))
                return new int[] {map.get(target-nums[i]),i};
            map.put(nums[i],i);
        }
        return null;
    }

完整代码（附运行结果）

package leetcode;

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

public class TowSum {
    //暴力法
    /*
    public static int [] TowNumberSum_1(int []nums,int target)
    {
        for(int i=0;i<nums.length;i++)
        {
            for(int j=i+1;j<nums.length;j++){
                if(nums[i]+nums[j]==target){
                    return new int[]{i, j};
                }
            }
        }
       return null;
    }
     */
    //哈希表法
    public static int[] TowNumberSum_2(int [] nums,int target)
    {
        Map<Integer,Integer>map=new HashMap<>();
        for(int i=0;i<nums.length;i++)
        {
            if(map.containsKey(target-nums[i]))
                return new int[] {map.get(target-nums[i]),i};
            map.put(nums[i],i);
        }
        return null;
    }

    public static void main(String [] args)
    {
        int [] nums={1,5,7,3};
        int target=12;
        System.out.println(Arrays.toString(TowNumberSum_2(nums, target)));
    }

}