1. Two Sum

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

zhouyanz

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

阅读量174

点赞数

分类专栏： Leetcode 文章标签： Java LeetCode

本文链接：https://blog.csdn.net/zhouyanz/article/details/50926925

版权

Leetcode 专栏收录该内容

196 篇文章 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.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int index1=0,index2=0;
        outer:
        for(;index1<nums.length;index1++){
            for(index2=index1+1;index2<nums.length;index2++){
                if(nums[index1]+nums[index2]==target)break outer;
            }
        }
    int[] result ={
        index1+1,index2+1
    };
    return result;
    }
}