1. Two Sum

我的做法 time ： O(N2)

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

————————————————————————————————————————————————————————————

1. Two Sum

原文：http://www.cnblogs.com/bloomingFlower/p/6781591.html