LeetCode1: 两数之和
Java解法:
public int[] twoSum(int[] nums, int target) {
int[] result = new int[2];
for (int i = 0; i < nums.length; i++) {
for (int i1 = i+1; i1 < nums.length; i1++) {
if (nums[i] + nums[i1] == target) {
result[0] = i;
result[1] = i1;
}
}
}
return result;
}