/**
* https://leetcode.com/problems/majority-element/
* @param {number[]} nums
* @return {number}
*/
var majorityElement = function(nums) {
var hashTable = {}, answer;
if (nums.length === 1) {
return nums[0];
}
for (let i = 0; i < nums.length; i++) {
if (hashTable[nums[i]] === undefined) {
hashTable[nums[i]] = 1;
} else {
hashTable[nums[i]]++;
if (hashTable[nums[i]] > (nums.length/2)) {
answer = nums[i];
break;
}
}
}
return answer;
};
'알고리즘 > LeetCode' 카테고리의 다른 글
[Leetcode][Javascript][Easy] 136. Single Number (0) | 2021.07.07 |
---|---|
[Leetcode][Javascript][Easy] 70. Climbing Stairs (0) | 2021.07.06 |
[Leetcode][Javascript][Easy] 21. Merge Two Sorted Lists (0) | 2021.07.06 |
[Leetcode][Javascript][Medium] 107. Binary Tree Level Order Traversal II (0) | 2021.07.05 |
[Leetcode][Javascript][Medium] 102. Binary Tree Level Order Traversal (0) | 2021.07.05 |
댓글