1. Two Sum

最新推荐文章于 2019-06-02 15:51:25 发布

Shezzer

最新推荐文章于 2019-06-02 15:51:25 发布

阅读量159

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Shezzer/article/details/79751202

LeetCode 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的经典算法。给定一个整数数组和目标值，找出数组中和为目标值的两个数，并返回它们的下标。文章提供了两种解决方案，详细解释了其实现思路及时间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

My solution:

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        for(int i = 0; i < nums.length -1; i++){
            for(int j = i + 1; j < nums.length; j++){
                if(nums[i] + nums[j] == target && i != j){
                    result[0] = i;
                    result[1] = j;
                    return result;
                }
            }            
        }
        return result;
    }
}

Approach #1

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(n²) Space complexity : O(1)