style: format php code

Author: acbin

lcof/面试题05. 替换空格/Solution.php

@@ -4,11 +4,14 @@ class Solution {
      * @return String
      */
     function replaceSpace($s) {
-        $rs = "";
+        $rs = '';
         for ($i = 0; $i < strlen($s); $i++) {
-            if ($s[$i] === " ") $rs = $rs."%20";
-            else $rs = $rs.$s[$i];
+            if ($s[$i] === ' ') {
+                $rs = $rs . '%20';
+            } else {
+                $rs = $rs . $s[$i];
+            }
         }
         return $rs;
     }
-}
+}

run_format.py

@@ -77,14 +77,38 @@ def format_py():
                     os.remove(p2)
 
 
+def format_php():
+    for root, _, files in os.walk(path):
+        for name in files:
+            if name.endswith('.php'):
+                p1 = root + '/' + name
+                with open(p1, 'r', encoding='utf-8') as f:
+                    content = f.read()
+                    content = '<?php\n' + content
+                with open(p1, 'w', encoding='utf-8') as f:
+                    f.write(content)
+    command = f'npx prettier --write "**/*.php"'
+    os.system(command)
+    for root, _, files in os.walk(path):
+        for name in files:
+            if name.endswith('.php'):
+                p1 = root + '/' + name
+                with open(p1, 'r', encoding='utf-8') as f:
+                    content = f.read()
+                    content = content.replace('<?php\n', '')
+                with open(p1, 'w', encoding='utf-8') as f:
+                    f.write(content)
+
+
 def git_add():
     """Git add all files"""
     command = 'git add .'
     os.system(command)
 
 
 if __name__ == '__main__':
-    clang_format()
-    prettier_format()
+    # clang_format()
+    # prettier_format()
     # format_py()
     # git_add()
+    format_php()

solution/0000-0099/0001.Two Sum/Solution.php

@@ -13,4 +13,4 @@ function twoSum($nums, $target) {
             $hashtable[$x] = $key;
         }
     }
-}
+}

solution/0000-0099/0013.Roman to Integer/Solution.php

@@ -4,14 +4,25 @@ class Solution {
      * @return Integer
      */
     function romanToInt($s) {
-        $hashmap = array('I' => 1, 'V' => 5, 'X' => 10, 'L' => 50, 'C' => 100, 'D' => 500, 'M' => 1000);
+        $hashmap = [
+            'I' => 1,
+            'V' => 5,
+            'X' => 10,
+            'L' => 50,
+            'C' => 100,
+            'D' => 500,
+            'M' => 1000,
+        ];
         $rs = 0;
         for ($i = 0; $i < strlen($s); $i++) {
             $left = $hashmap[$s[$i]];
             $right = $hashmap[$s[$i + 1]];
-            if ($left >= $right) $rs += $left;
-            else $rs -= $left;
+            if ($left >= $right) {
+                $rs += $left;
+            } else {
+                $rs -= $left;
+            }
         }
         return $rs;
     }
-}
+}

solution/0000-0099/0014.Longest Common Prefix/Solution.php

@@ -4,13 +4,15 @@ class Solution {
      * @return String
      */
     function longestCommonPrefix($strs) {
-        $rs = "";
+        $rs = '';
         for ($i = 0; $i < strlen($strs[0]); $i++) {
             for ($j = 1; $j < count($strs); $j++) {
-                if ($strs[0][$i] != $strs[$j][$i]) return $rs;
+                if ($strs[0][$i] != $strs[$j][$i]) {
+                    return $rs;
+                }
             }
-            $rs = $rs.$strs[0][$i];
+            $rs = $rs . $strs[0][$i];
         }
         return $rs;
     }
-}
+}

solution/0000-0099/0026.Remove Duplicates from Sorted Array/Solution.php

@@ -1,16 +1,15 @@
 class Solution {
-
     /**
      * @param Integer[] $nums
      * @return Integer
      */
     function removeDuplicates(&$nums) {
         $k = 0;
-        foreach($nums as $x) {
+        foreach ($nums as $x) {
             if ($k == 0 || $x != $nums[$k - 1]) {
                 $nums[$k++] = $x;
             }
         }
         return $k;
     }
-}
+}

solution/0000-0099/0027.Remove Element/Solution.php

@@ -1,5 +1,4 @@
 class Solution {
-
     /**
      * @param Integer[] $nums
      * @param Integer $val

solution/0000-0099/0028.Find the Index of the First Occurrence in a String/Solution.php

@@ -5,16 +5,16 @@ class Solution {
      * @return Integer
      */
     function strStr($haystack, $needle) {
-        $strNew = str_replace($needle, "+", $haystack);
-        $cnt = substr_count($strNew, "+");
+        $strNew = str_replace($needle, '+', $haystack);
+        $cnt = substr_count($strNew, '+');
         if ($cnt > 0) {
             for ($i = 0; $i < strlen($strNew); $i++) {
-                if ($strNew[$i] == "+") {
+                if ($strNew[$i] == '+') {
                     return $i;
                 }
             }
         } else {
             return -1;
         }
     }
-}
+}

solution/0000-0099/0058.Length of Last Word/Solution.php

@@ -5,13 +5,13 @@ class Solution {
      */
     function lengthOfLastWord($s) {
         $count = 0;
-        while ($s[strlen($s) - 1] == " ") {
+        while ($s[strlen($s) - 1] == ' ') {
             $s = substr($s, 0, -1);
         }
-        while (strlen($s) != 0 && $s[strlen($s) - 1] != " ") {
+        while (strlen($s) != 0 && $s[strlen($s) - 1] != ' ') {
             $count++;
             $s = substr($s, 0, -1);
         }
         return $count;
     }
-}
+}

solution/0000-0099/0070.Climbing Stairs/Solution.php

@@ -13,4 +13,4 @@ function climbStairs($n) {
         }
         return $dp[$n];
     }
-}
+}

solution/0000-0099/0088.Merge Sorted Array/Solution.php

@@ -15,4 +15,4 @@ function merge(&$nums1, $m, $nums2, $n) {
         }
         asort($nums1);
     }
-}
+}

solution/0100-0199/0100.Same Tree/Solution.php

@@ -18,15 +18,16 @@ class Solution {
      * @return Boolean
      */
     function isSameTree($p, $q) {
-        if ($p == Null && $q == Null) {
+        if ($p == null && $q == null) {
             return true;
         }
-        if ($p == Null || $q == Null) {
+        if ($p == null || $q == null) {
             return false;
         }
         if ($p->val != $q->val) {
             return false;
         }
-        return $this->isSameTree($p->left, $q->left) && $this->isSameTree($p->right, $q->right);
+        return $this->isSameTree($p->left, $q->left) &&
+            $this->isSameTree($p->right, $q->right);
     }
-}
+}

solution/0100-0199/0121.Best Time to Buy and Sell Stock/Solution.php

@@ -13,4 +13,4 @@ function maxProfit($prices) {
         }
         return $win;
     }
-}
+}

solution/0100-0199/0125.Valid Palindrome/Solution.php

@@ -4,10 +4,12 @@ class Solution {
      * @return Boolean
      */
     function isPalindrome($s) {
-        $regex = "/[a-z0-9]/";
+        $regex = '/[a-z0-9]/';
         $s = strtolower($s);
         preg_match_all($regex, $s, $matches);
-        if ($matches[0] == Null) return true;
+        if ($matches[0] == null) {
+            return true;
+        }
         $len = floor(count($matches[0]) / 2);
         for ($i = 0; $i < $len; $i++) {
             if ($matches[0][$i] != $matches[0][count($matches[0]) - 1 - $i]) {
@@ -16,4 +18,4 @@ function isPalindrome($s) {
         }
         return true;
     }
-}
+}

solution/0100-0199/0169.Majority Element/Solution.php

@@ -1,5 +1,4 @@
 class Solution {
-
     /**
      * @param Integer[] $nums
      * @return Integer
@@ -19,4 +18,4 @@ function majorityElement($nums) {
         }
         return $m;
     }
-}
+}

solution/0200-0299/0217.Contains Duplicate/Solution.php

@@ -7,4 +7,4 @@ function containsDuplicate($nums) {
         $numsUnique = array_unique($nums);
         return count($nums) != count($numsUnique);
     }
-}
+}

solution/0200-0299/0229.Majority Element II/Solution.php

@@ -8,9 +8,10 @@ function majorityElement($nums) {
         $n = count($nums);
         for ($i = 0; $i < $n; $i++) {
             $hashmap[$nums[$i]] += 1;
-            if ($hashmap[$nums[$i]] > $n / 3)
+            if ($hashmap[$nums[$i]] > $n / 3) {
                 array_push($rs, $nums[$i]);
+            }
         }
         return array_unique($rs);
     }
-}
+}

solution/0200-0299/0263.Ugly Number/Solution.php

@@ -5,11 +5,16 @@ class Solution {
      */
     function isUgly($n) {
         while ($n) {
-            if ($n % 2 == 0) $n = $n / 2;
-            else if ($n % 3 == 0) $n = $n / 3;
-            else if ($n % 5 == 0) $n = $n / 5;
-            else break;
+            if ($n % 2 == 0) {
+                $n = $n / 2;
+            } elseif ($n % 3 == 0) {
+                $n = $n / 3;
+            } elseif ($n % 5 == 0) {
+                $n = $n / 5;
+            } else {
+                break;
+            }
         }
         return $n == 1;
     }
-}
+}

solution/0200-0299/0268.Missing Number/Solution.php

@@ -5,10 +5,10 @@ class Solution {
      */
     function missingNumber($nums) {
         $n = count($nums);
-        $sumN = ($n + 1) * $n / 2;
+        $sumN = (($n + 1) * $n) / 2;
         for ($i = 0; $i < $n; $i++) {
             $sumN -= $nums[$i];
         }
         return $sumN;
     }
-}
+}

solution/0200-0299/0299.Bulls and Cows/Solution.php

@@ -9,15 +9,18 @@ function getHint($secret, $guess) {
         $cntB = 0;
         $len = strlen($secret);
         for ($i = 0; $i < $len; $i++) {
-            if ($secret[$i] == $guess[$i]) $cntA++;
-            else $hashtable[$secret[$i]] += 1;
+            if ($secret[$i] == $guess[$i]) {
+                $cntA++;
+            } else {
+                $hashtable[$secret[$i]] += 1;
+            }
         }
         for ($i = 0; $i < $len; $i++) {
             if ($secret[$i] != $guess[$i] && $hashtable[$guess[$i]] > 0) {
                 $cntB++;
                 $hashtable[$guess[$i]] -= 1;
             }
         }
-        return $cntA."A".$cntB."B";
+        return $cntA . 'A' . $cntB . 'B';
     }
-}
+}

solution/0300-0399/0349.Intersection of Two Arrays/Solution.php

@@ -12,8 +12,10 @@ function intersection($nums1, $nums2) {
             $hashmap[$set1[$i]] = 1;
         }
         for ($j = 0; $j < count($set2); $j++) {
-            if ($hashmap[$set2[$j]]) array_push($rs, $set2[$j]);
+            if ($hashmap[$set2[$j]]) {
+                array_push($rs, $set2[$j]);
+            }
         }
         return $rs;
     }
-}
+}

solution/0300-0399/0350.Intersection of Two Arrays II/Solution.php

@@ -17,4 +17,4 @@ function intersect($nums1, $nums2) {
         }
         return $rs;
     }
-}
+}

solution/0300-0399/0383.Ransom Note/Solution.php

@@ -10,9 +10,15 @@ function canConstruct($ransomNote, $magazine) {
             $hashtable[$arrM[$i]] += 1;
         }
         for ($j = 0; $j < strlen($ransomNote); $j++) {
-            if (!isset($hashtable[$ransomNote[$j]]) || $hashtable[$ransomNote[$j]] == 0) return false;
-            else $hashtable[$ransomNote[$j]] -= 1;
+            if (
+                !isset($hashtable[$ransomNote[$j]]) ||
+                $hashtable[$ransomNote[$j]] == 0
+            ) {
+                return false;
+            } else {
+                $hashtable[$ransomNote[$j]] -= 1;
+            }
         }
         return true;
     }
-}
+}

solution/0300-0399/0387.First Unique Character in a String/Solution.php

@@ -14,4 +14,4 @@ function firstUniqChar($s) {
         }
         return -1;
     }
-}
+}