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].
直接跑循环。

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