Two Sum

##

#  Two Sum

#

#

  

class Solution(object):

  def twoSum(self, nums, target):

    dic = {}

    for i in range(len(nums)):

      if nums[i] in dic:

         return [dic[nums[i]], i]

      else:

         dic[target - nums[i]] = i

if __name__ == "__main__":

   s = Solution()

   nums =[2, 7, 11, 15]

   target = 9

   res =  s.twoSum(nums, target)

   print(res)

import java.util.HashMap;
 
class twoSum {

    public int[] twoSum(int[] nums, int target) {
       HashMap<Integer, Integer> dic = new HashMap<Integer, Integer>();
       //int[] res = new int[2];
       int[] res = {-1, -1};
       for(int i=0; i< nums.length; i++) {
           if(dic.containsKey(target - nums[i])) {
              res[0] = dic.get(target - nums[i]);
              res[1] = i;
              return res;
           } else {
              dic.put(nums[i], i);
           }
       }
       return res;
    }


   public static void main(String[] args) {
     int[] nums = {2, 7, 11, 15};
     int target = 9;

     int[] res = new twoSum().twoSum(nums, target);
     System.out.println(res[0]+ " " + res[1]);

   }
}