00 | Two Sum

question

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].

answer

 1 class solution {
 2 
 3     /**
 4      * @param integer[] $nums
 5      * @param integer $target
 6      * @return integer[]
 7      */
 8     public function twosum($nums, $target) {
 9         $res = [];
10         for($i=0; $i<count($nums); $i++) {
11             for($j=$i+1; $j<count($nums); $j++) {
12                 if($nums[$i]+$nums[$j] === $target) {
13                     array_push($res, $i);
14                     array_push($res, $j);
15                 } else {
16                     continue;
17                 }
18             }
19         }
20         return $res;
21     }
22 }

这是我想到的方案，the least efficient solution.