forked from rubythonode/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmajority-element.js
More file actions
42 lines (38 loc) · 751 Bytes
/
majority-element.js
File metadata and controls
42 lines (38 loc) · 751 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
* Majority Elements
*
* 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.
*
* Example 1:
*
* Input: [3,2,3]
* Output: 3
*
* Example 2:
*
* Input: [2,2,1,1,1,2,2]
* Output: 2
*/
/**
* @param {number[]} nums
* @return {number}
*/
const majorityElement = nums => {
let major = nums[0];
let count = 1;
for (let i = 1; i < nums.length; i++) {
if (count === 0) {
count++;
major = nums[i];
} else if (major === nums[i]) {
count++;
} else {
count--;
}
}
return major;
};
export { majorityElement };