Leetcode link for this question
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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
Code 1 (exhaustive search):
|
|
Submission Result:
Status: Accepted
Runtime: 5872 ms
Ranking: beats 9.41%
Code 2:
|
|
Submission Result:
Status: Accepted
Runtime: 52 ms
Ranking: beats 73.69%
近期评论