刷个题，击败0.17%...
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].
code:
1 public class Solution { 2 public int[] TwoSum(int[] nums, int target) { 3 int[] result=null; 4 int i; 5 for (i = 0; i < nums.Length; i++) 6 { 7 int j; 8 for (j = 0; j < nums.Length; j++) 9 { 10 if(i != j) 11 { 12 if (nums[i] + nums[j] == target) 13 { 14 result = new int[] {j, i}; 15 } 16 } 17 } 18 } 19 return result; 20 } 21 }
LeetCode Online Judge 1. Two Sum
原文：http://www.cnblogs.com/ly7576/p/6253861.html