leetcode\LongestPalindrome::longestPalindrome()

Complexity

Conditions	5
Paths	7

Size

Total Lines	15
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public static function longestPalindrome(string $s): int
    {
        if (empty($s)) {
            return 0;
        }
        [$ans, $map] = [0, []];
        for ($i = 0, $n = strlen($s); $i < $n; $i++) {
            $map[$s[$i]] = ($map[$s[$i]] ?? 0) + 1;
            if ($map[$s[$i]] === 2) {
                $ans += 2;
                unset($map[$s[$i]]);
            }
        }

        return $map ? $ans + 1 : $ans;

$map is of type array, thus it always evaluated to false.

    }