m0_66269747
2022-08-06 14:56
浏览 10

leetcode169

如題:
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

img

因判斷有錯,該如何進行調整

相关推荐 更多相似问题