题目:
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, and you may not use the same element twice.
题目大意:
求一个数组中两个元素的下标,这两个元素相加和为target。
example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
思路:
暴力枚举法
代码:
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] i = new int[2];
for(int x=0;x<nums.length;x++) {
for(int j=x+1;j<nums.length;j++) {
if(nums[x]+nums[j]==target) {
i[0] = x;
i[1] = j;
break;
}
}
}
return i;
}
}