refactor 1287

fishercoder1534 · fishercoder1534 · commit 1ab014ee5fe2 · 2020-08-22T06:30:37.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1287.java b/src/main/java/com/fishercoder/solutions/_1287.java
@@ -1,20 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 1287. Element Appearing More Than 25% In Sorted Array
- *
- * Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time.
- * Return that integer.
- *
- * Example 1:
- * Input: arr = [1,2,2,6,6,6,6,7,10]
- * Output: 6
- *
- * Constraints:
- *
- * 1 <= arr.length <= 10^4
- * 0 <= arr[i] <= 10^5
- * */
 public class _1287 {
     public static class Solution1 {
         public int findSpecialInteger(int[] arr) {
