> For the complete documentation index, see [llms.txt](https://cmmobile.gitbook.io/cmmobilebook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cmmobile.gitbook.io/cmmobilebook/cheng-shi-lian-xi-ti/shu-zi-cao-zuo/1.-two-sum.md).

# Two Sum

Easy

[Two Sum 題目](https://leetcode.com/problems/two-sum/)

{% embed url="<https://leetcode.com/problems/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, 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].
```