[LeetCode][1 Two Sum]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.

示例

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1]

这题非常简单，不赘述！

public class Solution1 {    public int[] twoSum(int[] nums, int target) {        int[] ret = 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) {                    ret[0] = i;                    ret[1] = j;                    return ret;                }            }        return ret;    }}