天天看點

[LeetCode]--1. 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.

example:

given nums = [2, 7, 11, 15], target = 9,

because nums[0] + nums[1] = 2 + 7 = 9,

return [0, 1].