# 两和

原创于 2017-09-20 15:30:34 发布 · 236 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数组-easy01

leetcode 专栏收录该内容

1 篇文章

订阅专栏

问题描述
**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].
**
**即给定一个整数数组，返回两个数字的索引，使它们相加到一个特定的目标。

您可以假设每个输入都只有一个解决方案，而您可能不会使用相同的元素两次。**

代码块

class Solution {
    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};
            }else
                System.out.println("No such two numbers");
        }
    }
}