leetcode-0001-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,return [0, 1].

---

解法1 暴力解法

最简单实现，双重循环

class Solution {
    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[i] + nums[j] == target) {
                  return new int[] {i, j};
              }
          }
      }
      return null;
    }
}

解法2 空间换时间

    public static int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        
        for(int i=0; i < nums.length; i++) {
            int j = target - nums[i];
            Object k = map.get(j);
            if (k != null) {
                int m = (int) k;
                return i > m ? new int[]{ m, i } : new int[]{ i, m };
            }
            map.put(nums[i], i);
        }
        return null;
    }

---