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

Before improved version:

class Solution {
  public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
      int complement = target - nums[i];
      if (map.containsKey(complement)) {
        return new int[] {map.get(complement), i};
      }
      map.put(nums[i], i);
    }
    throw new IllegalArgumentException("No two sum solution");
  }
}

Improved version:

class TwoSumSolution {
  public int[] twoSum(int[] nums, int targetNumber) {
    Map<Integer, Integer> targetNumberRemainMap = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
      int remainNumber = targetNumber - nums[i];
      if (targetNumberRemain.containsKey(remainNumber)) {
        return new int[] {targetNumberRemainMap.get(remainNumber), i};
      }
      targetNumberRemainMap.put(nums[i], i);
    }
    throw new IllegalArgumentException("No two sum solution");
  }
}

Time complexity : o(n^2). 

Space complexity : O(1). 

second solution:

public int[] twoSum(int[] nums, int targetNumber) {
    Map<Integer, Integer> targetNumberRemainMap = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        targetNumberRemainMap.put(nums[i], i);
    }
    for (int i = 0; i < nums.length; i++) {
        int remainNumber = targetNumber - nums[i];
        if (targetNumberRemainMap.containsKey(remainNumber) && targetNumberRemainMap.get(remainNumber) != i) {
            return new int[] { i, map.get(remainNumber) };
        }
    }
    throw new IllegalArgumentException("No two sum solution");
}

Time complexity : O(n).

Space complexity : O(n).

third solution

public int[] twoSum(int[] nums, int targetNumber) {
    Map<Integer, Integer> targetNumberRemainMap = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int remainNumber = targetNumber - nums[i];
        if (targetNumberRemainMap.containsKey(remainNumber)) {
            return new int[] { map.get(remainNumber), i };
        }
        targetNumberRemainMap.put(nums[i], i);
    }
    throw new IllegalArgumentException("No two sum solution");
}

Time complexity : O(n).

Space complexity : O(n).

---

C solution:

int* twoSum(int* nums, int numsSize, int target) {
    int *ret = (int *)malloc(2 * sizeof(int));

    for (int i = 0; i < numsSize; i++) {
        for (int j = i + 1; j < numsSize; j++) {
            if (nums[i] + nums[j] == target) {
                ret[0] = i;
                ret[1] = j;
                return ret;
            }
        }
    }
    return ret;
}

the solution here is wrong, because the index1 and index2 at the last do not need to add 1.

 

---

C++ solution:

 

Question: Where its application scenarios？

references:

1. https://leetcode.com/problems/two-sum/