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/BackspaceStringCompare.php

Spacing +2 added lines, -2 removed lines

@@ -11,7 +11,7 @@ 
         if (empty($s) || empty($t)) {
             return false;
         }
-        $helper = static function (string &$s, int &$i) {
+        $helper = static function(string &$s, int &$i) {
             $n = 0;
             while ($i >= 0 && ($n > 0 || $s[$i] === '#')) {
                 $n = $s[$i] === '#' ? $n + 1 : $n - 1;
@@ -65,7 +65,7 @@ 
         if (empty($s) || empty($t)) {
             return false;
         }
-        $helper = static function (string $s, array $stack) {
+        $helper = static function(string $s, array $stack) {
             $n = strlen($s);
             for ($i = 0; $i < $n; $i++) {
                 if ($s[$i] === '#') {

src/leetcode/IntersectionOfTwoArrays.php

Spacing +1 added lines, -1 removed lines

@@ -65,7 +65,7 @@
         if (empty($p) || empty($q)) {
             return [];
         }
-        $helper = static function (array $nums, int $target): bool {
+        $helper = static function(array $nums, int $target): bool {
             [$low, $high] = [0, count($nums) - 1];
             while ($low <= $high) {
                 $mid = $low + intdiv($high - $low, 2);