首页 > 代码库 > LeetCode 169:Majority Element
LeetCode 169:Majority Element
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.
//解题思路:先排序,后对数组进行遍历 class Solution { public: int majorityElement(vector<int>& nums) { int n = nums.size(); if (n == 0) return nums[0]; int c = 0; sort(nums.begin(), nums.end()); //对数组进行排序 for (int i = 0; i < n; ) { for (int j = i; j < n; ++j) { if (nums[j] == nums[i]) c++; else { i = j; continue; } if (c>n / 2) return nums[j - 1]; else { continue; } } } } };
LeetCode 169:Majority Element
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。