Leetcode "1" and Sum

Source: Internet
Author: User

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 Le SS 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

Notice the bold exactly, with only one. So you don't have to think too much. Too much thinking is a liability. A direct double loop is no good, absolutely timed out. Not much to say, on the code:

vector<int> Twosum (vector<int> &numbers,inttarget) {Vector<int>index; Map<int,int>m;  for(inti =0; I < numbers.size (); ++i) {if(M.find (target-numbers[i])! =M.end ()) {Index.push_back (M[target-Numbers[i]] +1); Index.push_back (i+1);  Break; } M[numbers[i]]=i; }    returnindex;}

Leetcode "1" and Sum

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.