add 1299

fishercoder1534 · fishercoder1534 · commit b94da2008d87 · 2019-12-28T10:16:07.000-08:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
 |1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||
+|1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | |Easy||
 |1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | |Medium||
 |1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | |Medium||
 |1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1295.java) |  |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1299.java b/src/main/java/com/fishercoder/solutions/_1299.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.PriorityQueue;
+
+/**
+ * 1299. Replace Elements with Greatest Element on Right Side
+ *
+ * Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1.
+ * After doing so, return the array.
+ *
+ * Example 1:
+ * Input: arr = [17,18,5,4,6,1]
+ * Output: [18,6,6,6,1,-1]
+ * */
+public class _1299 {
+    public static class Solution1 {
+        public int[] replaceElements(int[] arr) {
+            PriorityQueue<Integer> heap = new PriorityQueue<>((a, b) -> b - a);
+            for (int num : arr) {
+                heap.offer(num);
+            }
+            int[] result = new int[arr.length];
+            for (int i = 0; i < arr.length - 1; i++) {
+                heap.remove(arr[i]);
+                result[i] = heap.peek();
+            }
+            result[arr.length - 1] = -1;
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1299Test.java b/src/test/java/com/fishercoder/_1299Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1299;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1299Test {
+    private static _1299.Solution1 solution1;
+    private static int[] arr;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1299.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        arr = new int[]{17, 18, 5, 4, 6, 1};
+        assertArrayEquals(new int[]{18, 6, 6, 6, 1, -1}, solution1.replaceElements(arr));
+    }
+
+}
