add 977

fishercoder1534 · fishercoder1534 · commit c874518ad69b · 2019-01-20T08:18:52.000-08:00
diff --git a/README.md b/README.md
@@ -29,6 +29,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_977.java) | O(nlogn) | O(1) | |Easy| Array
 |976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_976.java) | O(nlogn) | O(1) | |Easy| Math Array 
 |974|[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_974.java) | O(n) | O(n) | |Medium| Array|
 |973|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_973.java) | O(nlogn) | O(K) | |Easy| Math Sort|
diff --git a/src/main/java/com/fishercoder/solutions/_977.java b/src/main/java/com/fishercoder/solutions/_977.java
@@ -0,0 +1,35 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+/**
+ * 977. Squares of a Sorted Array
+ *
+ * Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.
+ *
+ * Example 1:
+ * Input: [-4,-1,0,3,10]
+ * Output: [0,1,9,16,100]
+ *
+ * Example 2:
+ * Input: [-7,-3,2,3,11]
+ * Output: [4,9,9,49,121]
+ *
+ *
+ * Note:
+ * 1 <= A.length <= 10000
+ * -10000 <= A[i] <= 10000
+ * A is sorted in non-decreasing order.
+ */
+public class _977 {
+  public static class Solution1 {
+    public int[] sortedSquares(int[] A) {
+      int[] result = new int[A.length];
+      for (int i = 0; i < A.length; i++) {
+        result[i] = (int) Math.pow(A[i], 2);
+      }
+      Arrays.sort(result);
+      return result;
+    }
+  }
+}
diff --git a/src/test/java/com/fishercoder/_977Test.java b/src/test/java/com/fishercoder/_977Test.java
@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._977;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _977Test {
+  private static _977.Solution1 solution1;
+  private static int[] A;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _977.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    A = new int[] {-4, -1, 0, 3, 10};
+    assertArrayEquals(new int[] {0, 1, 9, 16, 100}, solution1.sortedSquares(A));
+  }
+
+  @Test
+  public void test2() {
+    A = new int[] {-7, -3, 2, 3, 11};
+    assertArrayEquals(new int[] {4, 9, 9, 49, 121}, solution1.sortedSquares(A));
+  }
+}
