leetcode 1 Two Sum(水题）

最新推荐文章于 2021-12-21 12:31:34 发布

原创最新推荐文章于 2021-12-21 12:31:34 发布 · 158 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

25 篇文章

订阅专栏

本文解析了一道经典算法题目“两数之和”，详细介绍了如何在一个整数数组中找到两个数，使它们的和等于特定的目标值。通过一个简单的Java类实现，展示了双层循环遍历数组并检查每对元素是否满足目标和条件的方法。

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

题意：给一个一位数组和一个和，返回数组中相加得和的两数下标

bug：初始化数组 int[] A = new int[];写成了new A[]

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