← 返回 bytedance 的题目列表Two Sum
类型：online_judge
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice.
Input and Output Example:
Input: nums = [2, 7, 11, 15], target = 9 Output: [0, 1] Output explanation: Because nums[0] + nums[1] == 9, return [0, 1].
Data Scale:
2 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Only one valid answer exists.
Example
Input
[2, 7, 11, 15]
9