题目描述
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
分析:遍历数组找到两个数相加等于目标值的索引
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int index1=0;
int index2=0;
int[] result=new int[2];
for(int i=0;i<numbers.length;i++){
for(int j=i+1;j<numbers.length;j++){
if(numbers[i]+numbers[j]==target){
index1=i+1; //索引=数组下标+1
index2=j+1; //索引=数组下标+1
}
}
}
result[0]=index1;
result[1]=index2;
return result;
}
}