leetcode\TwoSumLessThanK

Complexity

Total Complexity

9

Size/Duplication

Total Lines	40
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	twoSumLessThanK2()	0	19	4
A	twoSumLessThanK()	0	17	5

<?php

declare(strict_types=1);

namespace leetcode;

class TwoSumLessThanK
{
    public static function twoSumLessThanK(array $nums, int $k): int
    {
        $ans = -1;
        if (empty($nums)) {
            return $ans;
        }
        $n = count($nums);
        for ($i = 0; $i < $n; $i++) {
            for ($j = 1; $j < $n; $j++) {
                $sum = $nums[$i] + $nums[$j];
                if ($sum < $k) {
                    $ans = max($ans, $sum);
                }
            }
        }

        return $ans;
    }

    public static function twoSumLessThanK2(array $nums, int $k): int
    {
        $ans = -1;
        if (empty($nums)) {
            return $ans;
        }
        sort($nums);
        [$ans, $l, $r] = [-1, 0, count($nums) - 1];
        while ($l <= $r) {
            $sum = $nums[$l] + $nums[$r];
            if ($sum < $k) {
                $ans = max($ans, $sum);
                $l++;
            } else {
                $r--;
            }
        }

        return $ans;
    }
}