LeetCode_Two Sum_Day 0x1

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

Solution:

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

submissions:

 Summary:

       思路没问题，具体实现细节有待优化，emmm，是该看看Java数据结构。。。