Templates for leetcode problem solutions

table of contents {.toc}

Problem description#

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.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]

Because nums[0] + nums[1] == 9, we return [0, 1].

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

Analysis#

Enumerate#

Go through the list and find the one matches target -x.

Hashtable#

Search in hashtable for matches of target -x then insert x itself.

Solutions#

Java#

1
class Solution {
2
    public int[] twoSum(int[] nums, int target) {
3
        Map<Integer, Integer> hashtable = new HashMap<Integer, Integer>();
4
        for (int i = 0; i < nums.length; ++i) {
5
            if (hashtable.containsKey(target - nums[i])) {
6
                return new int[]{hashtable.get(target - nums[i]), i};
7
            }
8
            hashtable.put(nums[i], i);
9
        }
10
        return new int[0];
11
    }
12
}

Time complexity: O(N), where NN is the number of elements in the array. For each element x, we can find target-x O(1)O(1).

Space complexity: O(N), where NN is the number of elements in the array. Mainly the overhead of the hash table.

Golang#

1
func twoSum(nums []int, target int) []int {
2
    for i, x := range nums {
3
        for j := i + 1; j < len(nums); j++ {
4
            if x+nums[j] == target {
5
                return []int{i, j}
6
            }
7
        }
8
    }
9
    return nil
10
}

Time complexity: O(N^2), where NN is the number of elements in the array. In the worst case, any two numbers in the array must be matched once.

Space complexity: O(1).

Reference#

https://leetcode-cn.com/problems/two-sum/solution/liang-shu-zhi-he-by-leetcode-solution/