leetcode\PartitionArrayIntoThreePartsWithEqualSum

Complexity

Total Complexity

6

Size/Duplication

Total Lines	24
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	canThreePartsEqualSum()	0	22	6

<?php

declare(strict_types=1);

namespace leetcode;

class PartitionArrayIntoThreePartsWithEqualSum
{
    public static function canThreePartsEqualSum(array $arr): bool
    {
        if (empty($arr)) {
            return false;
        }
        $sum = array_sum($arr);
        if ($sum % 3 !== 0) {
            return false;
        }
        $part = $cnt = 0;
        foreach ($arr as $num) {
            $part += $num;
            if ($part === (int) ($sum / 3)) {
                $part = 0;
                $cnt++;
                if ($cnt === 3) {
                    return true;
                }
            }
        }

        return false;
    }
}