LeetCode_001 Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Company LinkedIn Uber Airbnb Facebook Amazon Microsoft Apple Yahoo Dropbox Bloomberg Yelp Adobe
Tags Array Hash Table
Similar Problems (M) 3Sum (M) 4Sum (E) Two Sum II - Input array is sorted (E) Two Sum III - Data structure design

solution 1:
    use hashmap, time complexity: 

评论

暂无评论