add adobe directory

Author: Kevin Naughton Jr

company/adobe/MajorityElement.java

@@ -0,0 +1,24 @@
+//Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
+//You may assume that the array is non-empty and the majority element always exist in the array.
+
+class MajorityElement {
+    public int majorityElement(int[] nums) {
+        if(nums.length == 1) {
+            return nums[0];
+        }
+        
+        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
+        for(int current: nums) {
+            if(map.containsKey(current) && map.get(current) + 1 > nums.length / 2) {
+                return current;
+            } else if(map.containsKey(current)) {
+                map.put(current, map.get(current) + 1);
+            } else {
+                map.put(current, 1);
+            }
+        }
+        
+        //no majority element exists
+        return -1;
+    }
+}

leetcode/array/MajorityElement.java

@@ -0,0 +1,24 @@
+//Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
+//You may assume that the array is non-empty and the majority element always exist in the array.
+
+class MajorityElement {
+    public int majorityElement(int[] nums) {
+        if(nums.length == 1) {
+            return nums[0];
+        }
+        
+        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
+        for(int current: nums) {
+            if(map.containsKey(current) && map.get(current) + 1 > nums.length / 2) {
+                return current;
+            } else if(map.containsKey(current)) {
+                map.put(current, map.get(current) + 1);
+            } else {
+                map.put(current, 1);
+            }
+        }
+        
+        //no majority element exists
+        return -1;
+    }
+}