[Linda's LeetCode Diary 1] Two Sums

 

Description [Note: Description is provided by leetcode.com]

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

---

Method 1: Brute Force

My answer:

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        int flag = 0;
        for(int i = 0; i < nums.length; i++){
            for(int j = i+1; j < nums.length; j++){
                if (nums[i] + nums[j] == target){
                     result[0] = i;
                     result[1] = j;
                     flag = 1;
                     
                }
                
            }//end inner for
            if(flag == 1)
                    break;
        }//end outer for
        if(flag == 0)
            System.out.println("No such two numbers!");

        return result; 
    }
}

---

Method 2: Map [Note: Method 2 is provided by leetcode.com]

public int[] twoSum(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) {
            return new int[] { i, map.get(complement) };
        }
    }
    throw new IllegalArgumentException("No two sum solution");
}

---

Explain this line：

if (map.containsKey(complement) && map.get(complement) != i)

map.put(key, value)

map.containsKey -> boolean

For example:

nums[0] = 2, in this case, complement (the key) is 7.

map.containsKey(7) is to search whether key = 7 exists in this map or not; if it exists, then use map.get(7) to find the value corresponding to the key = 7.; if it does not exist, then map.containsKey(7) return false and will not execute the return statement.

So we can see that && can link both boolean and integer.

So using map is more straightforward, since the mature methods are written to help do the transverse things.