Skip to content

Update 0169-majority-element.cpp #3096

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
MHamiid merged 2 commits into from
Nov 6, 2023
Merged

Update 0169-majority-element.cpp #3096

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0fb6bad
Update 0169-majority-element.cpp
MarlzRana Oct 25, 2023
b090784
Replace zero initialization with zero assignment initialization
MarlzRana Oct 29, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 11 additions & 7 deletions cpp/0169-majority-element.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,12 +7,16 @@ The majority element is the element that appears more than ⌊n / 2⌋ times. Yo
class Solution {
public:
int majorityElement(vector<int>& nums) {
unordered_map<int, int> mp;
int n = nums.size();
for (int& i : nums){
if(++mp[i] > n/2)
return i;
}
return -1;
int count = 0;
int res = 0;

for (const int& num: nums) {
if (count == 0) {
res = num;
}
count += (num == res) ? 1 : -1;
}

return res;
}
};