FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
interviews/leetcode/array/MajorityElement.java at master · codingOnGithub/interviews · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
codingOnGithub
/
interviews
Public
forked from
kdn251/interviews
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
interviews
/
leetcode
/
array
/
MajorityElement.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
24 lines (21 loc) · 862 Bytes
Breadcrumbs
interviews
/
leetcode
/
array
/
MajorityElement.java
Copy path
File metadata and controls
24 lines (21 loc) · 862 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
//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
MajorityElement
{
public
int
majorityElement
(
int
[]
nums
) {
if
(
nums
.
length
==
1
) {
return
nums
[
0
];
}
HashMap
<
Integer
,
Integer
>
map
=
new
HashMap
<
Integer
,
Integer
>();
for
(
int
current
:
nums
) {
if
(
map
.
containsKey
(
current
) &&
map
.
get
(
current
) +
1
>
nums
.
length
/
2
) {
return
current
;
}
else
if
(
map
.
containsKey
(
current
)) {
map
.
put
(
current
,
map
.
get
(
current
) +
1
);
}
else
{
map
.
put
(
current
,
1
);
}
}
//no majority element exists
return
-
1
;
}
}
Back
|
FazBrowse Home
|
New Git URL