[update] 977

Author: Dream

README.md

@@ -32,7 +32,7 @@
 |980|[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | |Hard|
 |979|[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | |Medium|
 |978|[Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/) | |Medium|
-|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | |Easy|
+|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [java_dream](./algorithms/squaresOfASortedArray/SquaresOfASortedArray.java) |Easy|
 |976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) | |Easy|
 |971|[Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/) | |Medium|
 |969|[Pancake Sorting](https://leetcode.com/problems/pancake-sorting/) | |Medium|

algorithms/squaresOfASortedArray/SquaresOfASortedArray.java

@@ -0,0 +1,35 @@
+/**
+ * @author Dream
+ */
+public class SquaresOfASortedArray {
+    public int[] sortedSquares(int[] nums) {
+        int[] result = new int[nums.length];
+        int q = nums.length - 1;
+        for (int i = 0, j = nums.length - 1; i <= j;) {
+            int iNum = nums[i] * nums[i];
+            int jNum = nums[j] * nums[j];
+            if (iNum > jNum) {
+                result[q] = iNum;
+                i++;
+                q--;
+            }else if (iNum < jNum){
+                result[q] = jNum;
+                j--;
+                q--;
+            }else {
+                if (i == j) {
+                    result[q] = iNum;
+                    i++;
+                }else {
+                    result[q] = iNum;
+                    i++;
+                    q--;
+                    result[q] = jNum;
+                    j--;
+                    q--;
+                }
+            }
+        }
+        return result;
+    }
+}