refactor 1299

fishercoder1534 · fishercoder1534 · commit bc284b510d5f · 2020-09-07T07:13:03.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1299.java b/src/main/java/com/fishercoder/solutions/_1299.java
@@ -2,16 +2,6 @@
 
 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) {
