## 题目

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:

## 复杂度分析

• 时间复杂度：$O(n)$
• 空间复杂度：$O(n)$