imajinyun / leetcode-php

src/leetcode/LongestPalindromicSubstring.php

Spacing +4 added lines, -4 removed lines

@@ -12,7 +12,7 @@ 
         if ($n < 2) {
             return $s;
         }
-        $helper = static function (string $s) {
+        $helper = static function(string $s) {
             $n = strlen($s);
             for ($i = 0; $i < $n / 2; $i++) {
                 if ($s[$i] !== $s[$n - $i - 1]) {
@@ -44,8 +44,8 @@ 
         }
 
         $start = $length = 0;
-        $helper = static function (string $s, int $l, int $r, int &$start, int &$length) {
-            while ($l >= 0 && $r < strlen($s) && $s[$l ] === $s[$r]) {
+        $helper = static function(string $s, int $l, int $r, int &$start, int &$length) {
+            while ($l >= 0 && $r < strlen($s) && $s[$l] === $s[$r]) {
                 $l--;
                 $r++;
             }
@@ -85,7 +85,7 @@ 
                     $prev = $n - 1 - $j;
                     if ($prev + $dp[$i][$j] - 1 === $i) {
                         $max = $dp[$i][$j];
-                        $len= $i;
+                        $len = $i;
                     }
                 }
             }

src/leetcode/Pow.php

Spacing +1 added lines, -1 removed lines

@@ -50,7 +50,7 @@
         if ($n < 0) {
             return 1 / self::myPow3($x, -$n);
         }
-        $y = self::myPow3($x, (int)($n / 2));
+        $y = self::myPow3($x, (int) ($n / 2));
 
         return $n % 2 === 0 ? $y * $y : $y * $y * $x;
     }