TwoSum[Medium]

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

============================Answer=====================================

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        
        int[] returnList = new int[2];
        int index2;
        int maxNumber = 0;
        int minNumber = 0;
        int length =numbers.length;
        int[] tempBelowList=new int[1]; //create list for negative number
        int[] tempList;  //create list for positive number
        
        for(int i=0;i<length;i++) {
            if(maxNumber < numbers[i]) maxNumber = numbers[i];
            if(minNumber > numbers[i]) minNumber = numbers[i];
        }
          
         tempList = new int[maxNumber+1];
         int tempLength = maxNumber+1;
         for(int i=0;i<tempLength;i++)  {
             tempList[i]=-1;
         
         }
         
         if(minNumber < 0) {
            tempLength = -minNumber + 1;
            tempBelowList = new int[tempLength];
            for(int i=0;i<tempLength;i++)  {
                tempBelowList[i]=-1;
             }
         }
    
         
        for(int i=0;i<length;i++) {
            int val =numbers[i];
    
            if(val >= 0 ){
                  if(tempList[val] >=0 && val<<1==target) {
                          returnList[0]=tempList[val]+1;
                          returnList[1]= i+1;
                          break;
                }
                
                tempList[val]=i;
                index2 = target-val;
            }
            else {
                val=-val;
                if(tempBelowList[val] >=0 && val<<1==target) {
                          returnList[0]=tempBelowList[val]+1;
                          returnList[1]= i+1;
                          break;
                }
                tempBelowList[val]=i;
                index2 = target+val;
            }

            if(index2>maxNumber||index2<minNumber) continue;

            if(index2>=0) {
                val= tempList[index2];//the index of original array
            }
            else {
                 val= tempBelowList[-index2];//the index of original array
            }
            
            if(val>=0&&val!=i) {
                if( i < val) {
                    returnList[0]=i+1;
                    returnList[1]= val+1;
                }
                else{
                    returnList[0]=val+1;
                    returnList[1]= i+1;
                }
                 break;
            }
 
        }
     
       return returnList;
        
    }
}

================================================Answer Using HashMap===============================================================

import java.util.HashMap;
public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        
        int[] returnList = new int[2];
        int index2;
        HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
        int length = numbers.length; 
         
    
         
        for(int i=0;i<length;i++) {
            int val =numbers[i];
    
            if(map.get(val)!=null&&map.get(val) >=0 && val<<1==target) {
                          returnList[0]=map.get(val)+1;
                          returnList[1]= i+1;
                          break;
            }
            map.put(val,i);
                
            index2 = target-val;

            if(map.get(index2)==null) continue;
            
            int index1 = map.get(index2);

            if(index1>=0&&index1!=i) {
                if( i < index1) {
                    returnList[0]=i+1;
                    returnList[1]= index1+1;
                }
                else{
                    returnList[0]=index1+1;
                    returnList[1]= i+1;
                }
                 break;
            }
 
        }
     
       return returnList;
        
    }
}