Lesson05\Nesting::solution()

Complexity

Conditions	7
Paths	10

Size

Total Lines	24
Code Lines	16

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($S)
    {
        $length = strlen($S);
        if ($length) {
            $parentheses = [];
            for ($i = 0; $i < $length; $i++) {
                if ($S[$i] == '(') {
                    array_push($parentheses, '(');
                } elseif ($S[$i] == ')') {
                    if (empty($parentheses)) {
                        return 0;
                    }
                    array_pop($parentheses);
                }
            }
            if (empty($parentheses)) {
                return 1;
            } else {
                return 0;
            }
        }

        return 1;
    }
}