imajinyun / leetcode-php

src/leetcode/HappyNumber.php

Spacing +3 added lines, -3 removed lines

@@ -11,7 +11,7 @@ 
         if ($n <= 0) {
             return false;
         }
-        $helper = static function (int $num) {
+        $helper = static function(int $num) {
             [$sum, $tmp] = [0, null];
             while ($num) {
                 $tmp = $num % 10;
@@ -37,9 +37,9 @@ 
             return false;
         }
         $visited = [];
-        while ($n !== 1 && ! in_array($n, $visited, true)) {
+        while ($n !== 1 && !in_array($n, $visited, true)) {
             array_push($visited, $n);
-            $n = array_sum(array_map(fn ($x) => $x ** 2, str_split((string) $n)));
+            $n = array_sum(array_map(fn($x) => $x ** 2, str_split((string) $n)));
         }
 
         return !in_array($n, $visited, true);

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;