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.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

 

java实现

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

在看看网上的做法，初看不太懂，顿时感觉自己的智商为0了 。哎！这个世界让我觉得可怕哈

http://blog.csdn.net/tchenjx/article/details/52029450