leetcode\MonotonicArray

Complexity

Total Complexity

11

Size/Duplication

Total Lines	35
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	isMonotonic()	0	12	4
B	isMonotonic2()	0	19	7

<?php

declare(strict_types=1);

namespace leetcode;

class MonotonicArray
{
    public static function isMonotonic(array $arr): bool
    {
        if (empty($arr)) {
            return false;
        }
        $inc = $dec = true;
        for ($i = 1, $n = count($arr); $i < $n; $i++) {
            $inc &= $arr[$i - 1] <= $arr[$i];
            $dec &= $arr[$i - 1] >= $arr[$i];
        }

        return $inc || $dec;
    }

    public static function isMonotonic2(array $arr): bool
    {
        if (empty($arr)) {
            return false;
        }
        $inc = $dec = true;
        for ($i = 0, $n = count($arr) - 1; $i < $n; $i++) {
            if ($arr[$i] > $arr[$i + 1]) {
                $inc = false;
            }
            if ($arr[$i] < $arr[$i + 1]) {
                $dec = false;
            }
            if ($inc === false && $dec === false) {
                return false;
            }
        }

        return true;
    }
}