_1150.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1150 {
publicstaticclassSolution1 {
/*
 * credit: https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/discuss/358130/Java-just-one-binary-search-O(logN))-0ms-beats-100
 */
publicbooleanisMajorityElement(int[] nums, inttarget) {
intfirstIndex = findFirstOccur(nums, target);
intplusHalfIndex = firstIndex + nums.length / 2;
returnplusHalfIndex < nums.length && nums[plusHalfIndex] == target;
 }

privateintfindFirstOccur(int[] nums, inttarget) {
intleft = 0;
intright = nums.length;
while (left < right) {
intmid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid + 1;
 } elseif (nums[mid] >= target) {
right = mid;
 }
 }
returnleft;
 }
 }
}