leetcode_Two Sum

leetcode第一题

题目

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].
在数组nums中，取出你想得到的target，返回组成这两个数的在数组中的位置

// two sum
class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] slove = {0,0};
        for(int i=0;i<nums.length;i++)
        {
            for(int j=i+1;j<nums.length;j++) 
            //这里我理解为，数组中第一个与后面所有的都没有
            //可以得到target，所以是从第i+1个开始
            {
                if(nums[i]+nums[j]==target)
                {
                    slove[0] = i;
                    slove[1] = j;
                    return slove;
                }
            }
        }
        return slove;         
    }
}

测试结果

图片:

21.05%结果不是很高，不过第一题啦，只是一个开始