Постановка задачи

Ссылка: https://leetcode.com/problems/two-sum/

Мое решение для отладки

<?php

/**
 * Class Solution
 * @source https://leetcode.com/problems/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]
 * Output: Because nums[0] + nums[1] == 9, we return [0, 1].
 *
 * Example 2:
 * Input: nums = [3,2,4], target = 6
 * Output: [1,2]
 *
 * Result: OK, Accepted
 * Runtime: 1052 ms, faster than 46.54% of PHP online submissions for Two Sum.
 * Memory Usage: 16.2 MB, less than 86.87% of PHP online submissions for Two Sum.
 */

class Solution
{
    /**
     * @param Integer[] $nums
     * @param Integer $target
     * @return Integer[]
     */
    function twoSum($nums, $target)
    {
        if(!is_array($nums) || !count($nums)) {
            return [];
        }

        $len = count($nums);
        for($i = 0; $i < $len - 1; $i++) {
            for($j = $i + 1; $j < $len; $j++) {
                if($nums[$i] + $nums[$j] == $target) {
                    return [$i, $j];
                }
            }
        }

        return [];
    }
}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// Example 1:
echo "nnExample 1n";
$nums = [2, 7, 11, 15];
$target = 9;
$obj = new Solution();
$ret = $obj->twoSum($nums, $target);
echo var_export($ret, 1);
// [0, 1].

// Example 2:
echo "nnExample 2n";
$nums = [3,2,4];
$target = 6;
$ret = $obj->twoSum($nums, $target);
echo var_export($ret, 1);
// Output: [1,2]

// Example 3:
echo "nnExample 3n";
$nums = [3,3];
$target = 6;
$ret = $obj->twoSum($nums, $target);
echo var_export($ret, 1);
// Output: [0,1]

// MY TESTS

echo "nnExample 4n";
$nums = [9];
$target = 9;
$ret = $obj->twoSum($nums, $target);
echo var_export($ret, 1);
// [] ?

echo "nnExample 4n";
$nums = [];
$target = 9;
$ret = $obj->twoSum($nums, $target);
echo var_export($ret, 1);
// [] ?

Мое отосланное решение

class Solution {

    /**
     * @param Integer[] $nums
     * @param Integer $target
     * @return Integer[]
     */
    function twoSum($nums, $target) {
        if(!is_array($nums) || !count($nums)) {
            return [];
        }

        $len = count($nums);
        for($i = 0; $i < $len - 1; $i++) {
            for($j = $i + 1; $j < $len; $j++) {
                if($nums[$i] + $nums[$j] == $target) {
                    return [$i, $j];
                }
            }
        }

        return [];
        
    }
}

Результат

Исходник тут:

• expphpexpLeetcodetwo_sum.php

• https://github.com/nujensait/phpexp/blob/main/Leetcode/two_sum.php