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

package host;

public class Main {
		// TODO Auto-generated method stub
	public static void main (String[] args)
	{  
		int[] input={2,4,7,8,9};
		int l=input.length;
		int target=11;
		for (int i = 0; i < l; i++) {
			for (int j = i; j < l; j++) {
				if (input[i]+input[j]==target) {
					System.out.println("["+input[i]+","+input[j]+"]");
				}
			}
		}
	}
}

leetcode   Two Sum

原文：http://zhenzhuangde.blog.51cto.com/10697385/1851823