leetcode\RomanToInteger

Complexity

Total Complexity

8

Size/Duplication

Total Lines	37
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	romanToInt()	0	16	4
A	romanToInt2()	0	17	4

<?php

declare(strict_types=1);

namespace leetcode;

class RomanToInteger
{
    public static function romanToInt(string $s): int
    {
        [$res, $len] = [0, strlen($s)];
        if ($len === 0) {
            return $res;
        }
        $map = ['I' => 1, 'V' => 5, 'X' => 10, 'L' => 50, 'C' => 100, 'D' => 500, 'M' => 1000];
        for ($i = 0, $j = 1; $j < $len; $i++, $j++) {
            if ($map[$s[$i]] >= $map[$s[$j]]) {
                $res += $map[$s[$i]];
            } else {
                $res -= $map[$s[$i]];
            }
        }

        return $res + $map[$s[$i]];
    }

    public static function romanToInt2(string $s): int
    {
        if (empty($s)) {
            return 0;
        }
        $n = strlen($s);
        $map = ['I' => 1, 'V' => 5, 'X' => 10, 'L' => 50, 'C' => 100, 'D' => 500, 'M' => 1000];
        $num = $map[$s[$n - 1]];
        for ($i = $n - 2; $i >= 0; $i--) {
            if ($map[$s[$i]] < $map[$s[$i + 1]]) {
                $num -= $map[$s[$i]];
            } else {
                $num += $map[$s[$i]];
            }
        }

        return $num;
    }
}