1. Two Sum

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) {
// Start typing your Java solution below
// DO NOT write main() function
  int length = numbers.length;
  HashMap<Integer, Integer> dict = new HashMap<Integer, Integer>();
  int[] result = new int[2];

  for (int i = 0; i< length; i++)
  {
    dict.put(numbers[i],i);
  }

  for (int i = 0; i<length;i++)
  {
    int diff = target - numbers[i];
    Integer temp = dict.get(diff);

    if (temp!=null)
    {
      result[0] = i+1;
      result[1] = temp+1;
      return result;
    }
  }

  return null;
  }
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s