【LeetCode】 01 Two_Sum

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

代码

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

public class two_sum {
    /*Given nums = [2, 7, 11, 15], target = 9,
    Because nums[0] + nums[1] = 2 + 7 = 9,
            return [0, 1]. */

    public static void main(String []args){

        int [] nums=new int[]{2,2,2,7};
        int target=4;
        two_sum twoSun=new two_sum();

        int[] res1=twoSun.twoSum(nums,target);
        System.out.println(Arrays.toString(res1));

        int []res2=twoSun.twoSum2(nums,target);
        System.out.println(Arrays.toString(res1));
    }

/*************************************方法 1 ************************************/


    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[j] == target - nums[i]) {
                    return new int[] { i, j };
                }
            }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
    /*************************************  方法 1 end  ************************************/

    /*************************************  方法 2 start  ************************************/
    public int[] twoSum2(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            map.put(nums[i], i);
        }
        for (int i = 0; i < nums.length; i++) {
            int complement = target - nums[i];
            if (map.containsKey(complement) && map.get(complement) != i) {

                //  map.get(complement) != i 防止将nums[i]作为complement
                return new int[] { i, map.get(complement) };
            }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
    /*************************************  方法 2 end  ************************************/
}