add 1287

fishercoder1534 · fishercoder1534 · commit 436a34e931a3 · 2019-12-14T14:30:34.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) |  |  | |Easy||
 |1282|[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1282.java) |  |  | |Medium||
 |1281|[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1281.java) |  |  | |Easy||
 |1277|[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1277.java) |  |  | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1287.java b/src/main/java/com/fishercoder/solutions/_1287.java
@@ -0,0 +1,38 @@
+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) {
+            for (int i = 0; i < arr.length - 1; ) {
+                int count = 1;
+                if (arr[i] == arr[i + 1]) {
+                    do {
+                        i++;
+                        count++;
+                        if (count > arr.length / 4) {
+                            return arr[i];
+                        }
+                    } while (i < arr.length - 1 && arr[i] == arr[i + 1]);
+                } else {
+                    i++;
+                }
+            }
+            return arr[0];
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1287Test.java b/src/test/java/com/fishercoder/_1287Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1287;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1287Test {
+    private static _1287.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1287.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(6, solution1.findSpecialInteger(new int[]{1, 2, 2, 6, 6, 6, 6, 7, 10}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1, solution1.findSpecialInteger(new int[]{1}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(3, solution1.findSpecialInteger(new int[]{1, 2, 3, 3}));
+    }
+
+}
