[LeetCode]1、Two Sum

题目描述：

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

思路：

　　给定一个整形数组和一个整数target，返回2个元素的下标，它们满足相加的和为target。
　你可以假定每个输入，都会恰好有一个满足条件的返回结果。

public class Solution {
    public int[] twoSum(int[] nums,int target){
        int[] result = new int[2];
        for(int i = 0; i < nums.length;i++){
            for(int j = i+1; j < nums.length;j++){
                if(nums[i]+nums[j]==target){
                    result[0] = i;
                    result[1] = j;
                    //break;
                }
            }
        }
        return result;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] nums = {2, 7, 11, 15};
        int target = 9;
        int[] result = new int[2];
        Solution s = new Solution();
        result = s.twoSum(nums, target);
        for(int i = 0;i<2;i++){
            System.out.println(result[i]);
        }
    }

}

[LeetCode]1、Two Sum

相关推荐