add 1150

fishercoder1534 · fishercoder1534 · commit 2339293f7a7d · 2019-11-30T08:03:43.000-08:00
diff --git a/README.md b/README.md
@@ -20,6 +20,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | | | |Easy||
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | O(n) | O(m) | |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||
+|1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java) | | | |Easy||
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | O(n) | O(n) | |Easy||
 |1134|[Armstrong Number](https://leetcode.com/problems/armstrong-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) |  |  | [:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4)|Easy||
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1150.java b/src/main/java/com/fishercoder/solutions/_1150.java
@@ -0,0 +1,37 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1150. Check If a Number Is Majority Element in a Sorted Array
+ *
+ * Given an array nums sorted in non-decreasing order, and a number target, return True if and only if target is a majority element.
+ * A majority element is an element that appears more than N/2 times in an array of length N.
+ *
+ * Example 1:
+ * Input: nums = [2,4,5,5,5,5,5,6,6], target = 5
+ * Output: true
+ * Explanation:
+ * The value 5 appears 5 times and the length of the array is 9.
+ * Thus, 5 is a majority element because 5 > 9/2 is true.
+ *
+ * Example 2:
+ * Input: nums = [10,100,101,101], target = 101
+ * Output: false
+ * Explanation:
+ * The value 101 appears 2 times and the length of the array is 4.
+ * Thus, 101 is not a majority element because 2 > 4/2 is false.
+ *
+ * Note:
+ * 1 <= nums.length <= 1000
+ * 1 <= nums[i] <= 10^9
+ * 1 <= target <= 10^9
+ **/
+public class _1150 {
+    public static class Solution1 {
+        public boolean isMajorityElement(int[] nums, int target) {
+            int left = 0;
+            int right = nums.length - 1;
+            int mid = left + (right - left) / 2;
+            return nums[mid] == target;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1150Test.java b/src/test/java/com/fishercoder/_1150Test.java
@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1150;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1150Test {
+    private static _1150.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1150.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{2, 4, 5, 5, 5, 5, 5, 6, 6};
+        assertEquals(true, solution1.isMajorityElement(nums, 5));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{10, 100, 101, 101};
+        assertEquals(false, solution1.isMajorityElement(nums, 101));
+    }
+
+}
