首页 > 其他 > 详细

169. Majority Element

时间:2020-03-29 18:12:31      阅读:62      评论:0      收藏:0      [点我收藏+]

Problem:

Given an array of size n, find the majority element. The majority element is the element that appears more than ? n/2 ? times.

You may assume that the array is non-empty and the majority element always exist in the array.

Example 1:

Input: [3,2,3]
Output: 3

Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

思路

Solution (C++):

int majorityElement(vector<int>& nums) {
    int n = nums.size();
    sort(nums.begin(), nums.end());
    if (n%2) return nums[(n-1)/2];
    else return nums[n/2];
}

性能

Runtime: 52 ms??Memory Usage: 8.9 MB

思路

Solution (C++):


性能

Runtime: ms??Memory Usage: MB

169. Majority Element

原文:https://www.cnblogs.com/dysjtu1995/p/12593299.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!