题目:1. Two Sum
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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
//方法一:
public class Solution {
public int[] twoSum(int[] nums, int target) {
int i,j;
int len = nums.length;
int []arr=new int[2];
for(i=0;i<len-1;i++)
{
for(j=i+1;j<len;j++)
{
if(nums[i]+nums[j]==target)
{
arr[0]=i;
arr[1]=j;
}
}
}
return arr;
}
}
/*
Custom Testcase is [3,2,4],6
The test result is
Running time:73 ms
*/
/方法二
//思想://1.先对数组进行从小到大排序
// 2.求均值avr= target/2
// 3.一个小于等于avr加上一个大于等于avr的数才会等于target
//
/*public class Solution {
public int[] twoSum(int[] nums, int target) {
int avr = target/2;
int i,j;
int len = nums.length;
int []arr=new int[2];
for(i=0;i<len-1;i++)
{
j = i+1;
while(j<len)
{
if((nums[i]-avr)*(avr-nums[j])>=0 && nums[i]+nums[j]==target)
{
arr[0] = i;
arr[1] = j;
}
j++;
}
}
return arr;
}
}*/
/*
The test result :
Runtime: 86 ms
*/