← 返回 goldmansachs 的题目列表Two Sum: Find Indices of Numbers Adding to Target
类型:online_judge
goldmansachs
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.
Example
Input
[[2, 7, 11, 15], 9]