leetcode 1

package leet;


import java.util.Arrays;
import java.util.HashMap;






class Solution {
public static void main(String[] args)
{
int[] num={2, 7, 11, 15};
int sum=13;
int[] b=new int[2];
b=new Solution().twoSum(num, sum);
System.out.println("["+b[0]+" "+b[1]+"]");

}
private System system;
public int[] twoSum(int[] numbers, int target) {
        int [] res = new int[2];
        if(numbers==null||numbers.length<2)
           return res;
       HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
       for(int i = 0; i < numbers.length; i++){
           if(!map.containsKey(target-numbers[i])){
           map.put(numbers[i],i);
          }else{
              res[0]=map.get(target-numbers[i]);
              res[1]=i+1;
              break;
         }
        }
        return res;

   }

以上是hashmap方法。

int[] copylist=new int[numbers.length];
system.arraycopy(numbers,0,copylist,0,numbers.length);
Arrays.sort(copylist);
int i=0;
int j=numbers.length-1;
while(i<j)
{
int k=copylist[i]+copylist[j];
if(k<target)
i++;
if(k>target)
j--;
if(k==target)
{
res[0]=copylist[i];
res[1]=copylist[j];
break;
}
}
 
for(int r=0;r<numbers.length;r++)
{
if(numbers[r]==res[0])
res[0]=r;
if(numbers[r]==res[1])
res[1]=r;
}
   return res;
}

二分查找法