⭐️
# 題目敘述
Given an array nums of size n , return the majority element.
The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
# Example 1
Input: nums = [3,2,3]
Output: 3
# Example 2
Input: nums = [2,2,1,1,1,2,2]
Output: 2
# 解題思路
# Solution
import java.util.HashMap; | |
import java.util.Map; | |
class Solution { | |
public int majorityElement(int[] nums) { | |
Map<Integer, Integer> map = new HashMap<>(); | |
int max = 0; | |
int ans = 0; | |
for(int i = 0; i < nums.length; i++){ | |
int tmp = map.getOrDefault(nums[i], 0) + 1; | |
map.put(nums[i], tmp); | |
if(max < tmp){ | |
max = tmp; | |
ans = nums[i]; | |
} | |
} | |
return ans; | |
} | |
} |
單字
** **
!! !!
片語 & 搭配詞
!! !!
