Two Sum

最新推荐文章于 2022-02-05 12:19:14 发布

GBYQ66

最新推荐文章于 2022-02-05 12:19:14 发布

阅读量296

点赞数

分类专栏：学习文章标签： Two-Sum

本文链接：https://blog.csdn.net/GBYQ66/article/details/78153516

版权

学习专栏收录该内容

27 篇文章 0 订阅

订阅专栏

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.
在数组中找到两个数其相加和等于固定的值。返回这两个数的下标。

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