carloscn / carloscn/structstudy

leetcode169:多数元素(majority-element)

Open
#54 2 comments 0 reactions 1 assignee Claimed by @carloscn View on GitHub
Level-easy 一般问题 数组 查找
Dominant language
C
Stars
4
Forks
1
PR merge metrics
No merged PRs in 30d

Description

给定一个大小为 n 的数组 nums ,返回其中的多数元素。 (改造一下原题,只是最多的元素)

你可以假设数组是非空的,并且给定的数组总是存在多数元素。

示例 1:
输入:nums = [3,2,3]
输出:3

示例 2:
输入:nums = [2,2,1,1,1,2,2]
输出:2
 
提示:
n == nums.length
1 <= n <= 5 * 104
-109 <= nums[i] <= 109
 
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/majority-element

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.