[Leetcode] 169. Majority Element

🖥️ 시작하며

Given an array nums of size n, return the majority element.

⚙️ Python

from typing import List


class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        return max(nums, key=nums.count)

💡 더 좋은 아이디어

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        count = 1
        major = nums[0]
        length = len(nums)

        for i in range(1, length):
            if count == 0:
                count += 1
                major = nums[i]
            elif nums[i] == major:
                count += 1
            else:
                count -= 1

        return major

📌 소감