1. Title
The Sum of
2. Http Address
https://leetcode.com/problems/two-sum/
3. The question
Given an array of integers, find the numbers such that they add up to a specific target number.
The function twosum should return indices of the numbers such that they add up to the target, where index1 must is Les S than Index2. Please note that your returned answers (both Index1 and INDEX2) is not zero-based.
You may assume this each input would has exactly one solution.
Input: numbers={2, 7, one, A, target=9
Output: index1=1, index2=2
4 My Code (AC)
1 //Accepted time O (n); space o (n);2 Public Static int[] Twosum (int[] Nums,inttarget) {3 4map<integer,integer> map =NewHashmap<integer,integer>();5 intkey;6 intFindKey;7 int[] re =New int[2];8 for(inti = 0; i < nums.length; i++)9 {TenKey =Nums[i]; OneFindKey = target-key; A - if(Map.containskey (findkey)) - { theRe[0] =i; -RE[1] =Map.get (findkey); - Arrays.sort (re); - returnre; +}Else{ - Map.put (key,i); + } A at - } - return NULL; -}
The Sum of