leetcode\ReverseStringII::reverseStr2()

Complexity

Conditions	5
Paths	4

Size

Total Lines	20
Code Lines	14

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public static function reverseStr2(string $s, int $k): string
    {
        if (empty($s) || $k <= 0) {
            return '';
        }
        [$i, $n] = [0, strlen($s)];
        while ($i < $n) {
            $j = min($i + $k - 1, $n - 1);
            $m = $j + $k + 1;
            while ($i < $j) {
                $t = $s[$i];
                $s[$i] = $s[$j];
                $s[$j] = $t;
                $i++;
                $j--;
            }
            $i = $m;
        }

        return $s;
    }