-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTwoSum.php
More file actions
38 lines (36 loc) · 993 Bytes
/
Copy pathTwoSum.php
File metadata and controls
38 lines (36 loc) · 993 Bytes
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
<?php
namespace App;
/**
* 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].
*
* https://leetcode.com/problems/two-sum/
*/
class TwoSum
{
/**
* @param array<array-key, int> $nums
* @param int $target
* @return array|null
*/
public function twoSum(array $nums, int $target): ?array
{
foreach ($nums as $index1 => $num1) {
foreach ($nums as $index2 => $num2) {
if ($index1 !== $index2 && ($num1 + $num2) === $target) {
return [$index1, $index2];
}
}
}
return null;
}
}