feat: add php solution to lc problem: No.0977 (doocs#983)

Author: Qiu-IT

solution/0900-0999/0977.Squares of a Sorted Array/README.md

@@ -221,6 +221,35 @@ impl Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function sortedSquares($nums) {
+        $i = 0;
+        $j = $k = count($nums) - 1;
+        $rs = array_fill(0, count($nums), -1);
+        while ($i <= $j) {
+            $max1 = $nums[$i] * $nums[$i];
+            $max2 = $nums[$j] * $nums[$j];
+            if ($max1 > $max2) {
+                $rs[$k] = $max1;
+                $i++;
+            } else {
+                $rs[$k] = $max2;
+                $j--;
+            }
+            $k--;
+        }
+        return $rs;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0977.Squares of a Sorted Array/README_EN.md

@@ -169,6 +169,35 @@ impl Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function sortedSquares($nums) {
+        $i = 0;
+        $j = $k = count($nums) - 1;
+        $rs = array_fill(0, count($nums), -1);
+        while ($i <= $j) {
+            $max1 = $nums[$i] * $nums[$i];
+            $max2 = $nums[$j] * $nums[$j];
+            if ($max1 > $max2) {
+                $rs[$k] = $max1;
+                $i++;
+            } else {
+                $rs[$k] = $max2;
+                $j--;
+            }
+            $k--;
+        }
+        return $rs;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0977.Squares of a Sorted Array/Solution.php

@@ -0,0 +1,24 @@
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function sortedSquares($nums) {
+        $i = 0;
+        $j = $k = count($nums) - 1;
+        $rs = array_fill(0, count($nums), -1);
+        while ($i <= $j) {
+            $max1 = $nums[$i] * $nums[$i];
+            $max2 = $nums[$j] * $nums[$j];
+            if ($max1 > $max2) {
+                $rs[$k] = $max1;
+                $i++;
+            } else {
+                $rs[$k] = $max2;
+                $j--;
+            }
+            $k--;
+        }
+        return $rs;
+    }
+}