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.
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 a[]=new int[2];
if(nums.length<2){
return a;
}
int var;
for(int i=0;i<nums.length;i++){
for(int j=i+1;j<nums.length;j++){
if(nums[i]+nums[j]==target){
a[0]=i;
a[1]=j;
return a;
}
}
}
return a;
}
}
发现代码可优化每次j循环中if条件语句都会计算一次
优化代码:
class Solution {
public int[] twoSum(int[] nums, int target) {
int a[]=new int[2];
if(nums.length<2){
return a;
}
int var;
for(int i=0;i<nums.length;i++){
var=target-nums[i];
for(int j=i+1;j<nums.length;j++){
if(nums[j]==var){
a[0]=i;
a[1]=j;
return a;
}
}
}
return a;
}
}