leetcode－1. Two Sum－简单的算法题，面试见到了吗？

165 阅读 0 评论 109 点赞

我是靠谱客的博主机智彩虹，这篇文章主要介绍leetcode－1. Two Sum－简单的算法题，面试见到了吗？，现在分享给大家，希望可以做个参考。

leetcode第一道题，很简单大部分人应该能想到用map，而我只想到暴力，思维确实得到了锻炼。
Question： 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.

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

descript：给定一个数组，和目标值，求数组里两个数的和等于目标值的下标，数组里数不重复。

菜鸟解法 (Brute Force)

复制代码

1
2
3
4
5
6
7
8
9
10
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");
}

*Time complexity : O(n2 )
Space complexity : O(1 )*

大鸟解法

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
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");

*Time complexity : O(n)
Space complexity : O(n)*

飞鹰解法

复制代码

1
2
3
4
5
6
7
8
9
10
11
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");
}