Lipsky

# LeetCode 1 Two Sum

2020/02/16 Share

### 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 sameelement twice.

#### Detail:#

Time complexity: $O(n^2)$

​ n x n (row x column )

Space complexity: $O(1)$