FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_04/id_119/LeetCode_169_119.cpp at master · feixiangcode/algorithm · GitHub
feixiangcode
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_04
/
id_119
/
LeetCode_169_119.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
31 lines (29 loc) · 803 Bytes
Breadcrumbs
algorithm
/
Week_04
/
id_119
/
LeetCode_169_119.cpp
Copy path
File metadata and controls
31 lines (29 loc) · 803 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
class
Solution
{
public:
int
majorityElement
(vector<
int
>& nums) {
//
//哈希解法
//
unordered_map<int,int> digit_count;
//
for (int i = 0; i < nums.size(); i++) {
//
digit_count[nums[i]]++;
//
if (i >= (nums.size()>>1) && digit_count[nums[i]] > (nums.size()>>1)) {
//
return nums[i];
//
}
//
}
//
return -1;
//
摩尔投票法
int
res =
0
, cnt =
0
;
for
(
int
num:nums) {
if
(cnt ==
0
) {
res = num;
cnt++;
}
else
{
if
(res == num) {
cnt++;
}
else
{
cnt--;
}
}
}
return
res;
}
};
Back
|
FazBrowse Home
|
New Git URL