imajinyun / leetcode-php

src/leetcode/KthSmallestElementInASortedMatrix.php

Spacing +2 added lines, -2 removed lines

@@ -32,7 +32,7 @@ 
         }
         [$m, $n] = [count($matrix), count($matrix[0])];
         [$low, $high] = [$matrix[0][0], $matrix[$m - 1][$n - 1]];
-        $helper = static function (array $matrix, int $target) {
+        $helper = static function(array $matrix, int $target) {
             $n = count($matrix);
             [$cnt, $i, $j] = [0, $n - 1, 0];
             while ($i >= 0 && $j < $n) {
@@ -47,7 +47,7 @@ 
         };
 
         while ($low < $high) {
-            $mid = (int)(($high - $low) / 2) + $low;
+            $mid = (int) (($high - $low) / 2) + $low;
             $cnt = $helper($matrix, $mid);
             if ($cnt < $k) {
                 $low = $mid + 1;

src/leetcode/BasicCalculatorII.php

Spacing +6 added lines, -6 removed lines

@@ -30,10 +30,10 @@ 
                         array_push($stack, -$num);
                         break;
                     case '*':
-                        array_push($stack, (int)(array_pop($stack) * $num));
+                        array_push($stack, (int) (array_pop($stack) * $num));
                         break;
                     case '/':
-                        array_push($stack, (int)(array_pop($stack) / $num));
+                        array_push($stack, (int) (array_pop($stack) / $num));
                         break;
                 }
                 [$num, $operator] = [0, $char];
@@ -56,16 +56,16 @@ 
             $char = $s[$i];
             if (is_numeric($char)) {
                 if ($operator === '+') {
-                    array_push($stack, (int)$char);
+                    array_push($stack, (int) $char);
                 }
                 if ($operator === '-') {
-                    array_push($stack, -(int)$char);
+                    array_push($stack, -(int) $char);
                 }
                 if ($operator === '*') {
-                    array_push($stack, array_pop($stack) * (int)$char);
+                    array_push($stack, array_pop($stack) * (int) $char);
                 }
                 if ($operator === '/') {
-                    array_push($stack, (int)(array_pop($stack) / $char));
+                    array_push($stack, (int) (array_pop($stack) / $char));
                 }
             } else {
                 $operator = $char;

src/leetcode/EvaluateReversePolishNotation.php

Spacing +4 added lines, -4 removed lines

@@ -22,9 +22,9 @@ 
                 $stack->push($stack->pop() * $stack->pop());
             } elseif ($token === '/') {
                 [$b, $a] = [$stack->pop(), $stack->pop()];
-                $stack->push((int)($a / $b));
+                $stack->push((int) ($a / $b));
             } else {
-                $stack->push((int)$token);
+                $stack->push((int) $token);
             }
         }
 
@@ -39,7 +39,7 @@ 
         $stack = [];
         foreach ($tokens as $token) {
             if (!in_array($token, ['+', '-', '*', '/'])) {
-                array_push($stack, (int)$token);
+                array_push($stack, (int) $token);
             } else {
                 [$r, $l] = [array_pop($stack), array_pop($stack)];
                 if ($token === '+') {
@@ -49,7 +49,7 @@ 
                 } elseif ($token === '*') {
                     array_push($stack, $l * $r);
                 } else {
-                    array_push($stack, (int)($l / $r));
+                    array_push($stack, (int) ($l / $r));
                 }
             }
         }

src/leetcode/FindPeakElement.php

Spacing +1 added lines, -1 removed lines

@@ -26,7 +26,7 @@
         }
         [$left, $right] = [0, count($nums) - 1];
         while ($left < $right) {
-            $mid = $left + (int)(($right - $left) / 2);
+            $mid = $left + (int) (($right - $left) / 2);
             if ($nums[$mid] < $nums[$mid + 1]) {
                 $left = $mid + 1;
             } else {

src/leetcode/FindTheDuplicateNumber.php

Spacing +2 added lines, -2 removed lines

@@ -36,13 +36,13 @@
         }
         [$low, $high] = [$nums[0], count($nums) - 1];
         while ($low < $high) {
-            [$cnt, $mid] = [0, $low + (int)(($high - $low) / 2)];
+            [$cnt, $mid] = [0, $low + (int) (($high - $low) / 2)];
             foreach ($nums as $num) {
                 if ($num <= $mid) {
                     $cnt++;
                 }
             }
-            $cnt <= $mid ? ($low = $mid  + 1) : ($high = $mid);
+            $cnt <= $mid ? ($low = $mid + 1) : ($high = $mid);
         }
 
         return $low;

src/leetcode/LargestNumber.php

Spacing +5 added lines, -5 removed lines

@@ -18,11 +18,11 @@ 
                 }
             }
         }
-        if ((int)$nums[0] === 0) {
+        if ((int) $nums[0] === 0) {
             return '0';
         }
 
-        return (string)join('', $nums);
+        return (string) join('', $nums);
     }
 
     public static function largestNumber2(array $nums): string
@@ -30,14 +30,14 @@ 
         if (empty($nums)) {
             return '';
         }
-        usort($nums, static function ($a, $b) {
+        usort($nums, static function($a, $b) {
             return -(($a . $b) <=> ($b . $a));
         });
-        if ((int)$nums[0] === 0) {
+        if ((int) $nums[0] === 0) {
             return '0';
         }
 
-        return (string)implode('', $nums);
+        return (string) implode('', $nums);
     }
 
     private static function compare(int $a, int $b): int

src/leetcode/FirstBadVersion.php

Spacing +1 added lines, -1 removed lines

@@ -13,7 +13,7 @@
         }
         [$low, $high] = [1, $m];
         while ($low <= $high) {
-            $mid = $low + (int)(($high - $low) / 2);
+            $mid = $low + (int) (($high - $low) / 2);
             if (self::isBadVersion($mid, $n)) {
                 $high = $mid - 1;
             } else {

src/leetcode/HammingDistance.php

Spacing +2 added lines, -2 removed lines

@@ -12,9 +12,9 @@
             return 0;
         }
 
-        $z = (string)(decbin($x ^ $y));
+        $z = (string) (decbin($x ^ $y));
 
-        return (int)(substr_count($z, '1'));
+        return (int) (substr_count($z, '1'));
     }
 
     public static function hammingDistance2(int $x, int $y): int

src/leetcode/LongestPalindrome.php

Spacing +1 added lines, -1 removed lines

@@ -33,7 +33,7 @@
             $map[$s[$i]] = ($map[$s[$i]] ?? 0) + 1;
         }
         foreach ($map as $val) {
-            $ans += (int)($val / 2) * 2;
+            $ans += (int) ($val / 2) * 2;
             if ($ans % 2 === 0 && $val % 2 === 1) {
                 $ans++;
             }