leetcode\CountPrimes::countPrimes2()

Complexity

Conditions	5
Paths	4

Size

Total Lines	16
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public static function countPrimes2(int $n): int
    {
        if ($n <= 2) {
            return 0;
        }
        $dp = array_fill(0, $n, 1);
        $dp[0] = $dp[1] = 0;
        for ($i = 2; $i < $n; $i++) {
            if ($dp[$i]) {
                for ($j = $i * $i; $j < $n; $j += $i) {
                    $dp[$j] = 0;
                }
            }
        }

        return array_sum($dp);

The expression return array_sum($dp) could return the type double which is incompatible with the type-hinted return integer. Consider adding an additional type-check to rule them out.

    }