1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// @leetup=custom
// @leetup=info id=1 lang=rust slug=two-sum
/*
* 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.
*
* You can return the answer in any order.
*
*
* Example 1:
*
* Input: nums = [2,7,11,15], target = 9
* Output: [0,1]
* Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
*
* Example 2:
*
* Input: nums = [3,2,4], target = 6
* Output: [1,2]
*
* Example 3:
*
* Input: nums = [3,3], target = 6
* Output: [0,1]
*
*
* Constraints:
*
* * `2 <= nums.length <= 104`
* * `-109 <= nums[i] <= 109`
* * `-109 <= target <= 109`
* * Only one valid answer exists.
*
*
* Follow-up: Can you come up with an algorithm that is less than `O(n2)` time
* complexity?
*
*/
// @leetup=custom
// @leetup=code
// @leetup=code