leetcode-1. Two Sum

从今天开始，每天至少一个算法题，督促自己，不管难易都整理一下。

https://leetcode.com/problems/two-sum/#/description

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[] temp=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)
{
temp[0]=i;
temp[1]=j;

}
}

}

return temp;

}
}