Skip to content

Files

Latest commit

af138b3 · Apr 3, 2020

History

History

0001.two-sum

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Apr 3, 2020
Apr 3, 2020
Apr 3, 2020

README.md

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].

解题思路## 可能的變化