Create element-appearing-more-than-25-in-sorted-array.py

Author: kamyu104

Python/element-appearing-more-than-25-in-sorted-array.py

@@ -0,0 +1,16 @@
+# Time:  O(logn)
+# Space: O(1)
+
+import bisect
+
+
+class Solution(object):
+    def findSpecialInteger(self, arr):
+        """
+        :type arr: List[int]
+        :rtype: int
+        """
+        for x in [arr[len(arr)//4], arr[len(arr)//2], arr[len(arr)*3//4]]:
+            if (bisect.bisect_right(arr, x) - bisect.bisect_left(arr, x)) * 4 > len(arr):
+                return x
+        return -1