FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/Array/No747.java at master · Programming-With-Love/leetcode · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
Programming-With-Love
/
leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
15
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
Array
/
No747.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
24 lines (23 loc) · 471 Bytes
Breadcrumbs
leetcode
/
Array
/
No747.java
Copy path
File metadata and controls
24 lines (23 loc) · 471 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
package
Algorithm
.
leetcode
.
Array
;
/**
*
* Created by tujietg on Nov 6, 2019
*/
public
class
No747
{
public
int
dominantIndex
(
int
[]
nums
) {
// 找出最大的值與第二大的值的雙倍作比較
int
one
=
0
;
int
two
=
0
;
int
index
=
0
;
for
(
int
i
=
0
;
i
<
nums
.
length
;
i
++) {
if
(
nums
[
i
] >
one
) {
two
=
one
;
one
=
nums
[
i
];
index
=
i
;
}
else
if
(
nums
[
i
] >
two
) {
two
=
nums
[
i
];
}
}
return
(
one
>=
two
*
2
) ?
index
: -
1
;
}
}
Back
|
FazBrowse Home
|
New Git URL