FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_04/id_108/LeetCode_169_108.java at master · augfool/algorithm · GitHub
augfool
/
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_108
/
LeetCode_169_108.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
91 lines (78 loc) · 2.36 KB
Breadcrumbs
algorithm
/
Week_04
/
id_108
/
LeetCode_169_108.java
Copy path
File metadata and controls
91 lines (78 loc) · 2.36 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
package
com
.
algorithm
;
import
java
.
util
.
Arrays
;
import
java
.
util
.
HashMap
;
import
java
.
util
.
Map
;
/**
* @author zhangruihao.zhang
* @version v1.0.0
* @since 2019/05/12
*/
public
class
LeetCode_169_108
{
// 遍历一遍，相同则加1，不相同则减1，最后剩余的item就是众数
class
Solution1
{
public
int
majorityElement
(
int
[]
nums
) {
int
count
=
1
;
int
item
=
nums
[
0
];
for
(
int
i
=
1
;
i
<
nums
.
length
;
i
++) {
if
(
count
==
0
) {
item
=
nums
[
i
];
count
=
1
;
}
else
if
(
nums
[
i
] ==
item
) {
count
++;
}
else
{
count
--;
}
}
return
item
;
}
}
// 统计每个数字的词频，统计出现次数大于n/2的
class
Solution2
{
public
int
majorityElement
(
int
[]
nums
) {
Map
<
Integer
,
Integer
>
map
=
new
HashMap
<>();
int
maxCount
=
0
;
int
maxItem
=
0
;
for
(
int
num
:
nums
) {
int
count
=
map
.
getOrDefault
(
num
,
0
) +
1
;
if
(
map
.
keySet
().
isEmpty
()) {
maxCount
=
1
;
maxItem
=
num
;
}
if
(
map
.
keySet
().
contains
(
num
)) {
if
(
count
>
maxCount
) {
maxCount
=
count
;
maxItem
=
num
;
}
}
map
.
put
(
num
,
map
.
getOrDefault
(
num
,
0
) +
1
);
}
return
maxItem
;
}
}
//分治方法
class
Solution3
{
public
int
majorityElement
(
int
[]
nums
) {
if
(
nums
.
length
==
1
) {
return
nums
[
0
];
}
int
mid
=
nums
.
length
/
2
;
int
[]
left
=
Arrays
.
copyOfRange
(
nums
,
0
,
mid
);
int
[]
right
=
Arrays
.
copyOfRange
(
nums
,
mid
,
nums
.
length
);
int
a
=
majorityElement
(
left
);
int
b
=
majorityElement
(
right
);
if
(
a
==
b
) {
return
a
;
}
return
count
(
a
,
nums
) > (
nums
.
length
/
2
) ?
a
:
b
;
}
private
int
count
(
int
num
,
int
[]
nums
) {
int
count
=
0
;
for
(
int
i
:
nums
) {
if
(
num
==
i
) {
count
++;
}
}
return
count
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL