FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/Array/No448.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
/
No448.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
33 lines (29 loc) · 707 Bytes
Breadcrumbs
leetcode
/
Array
/
No448.java
Copy path
File metadata and controls
33 lines (29 loc) · 707 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
32
33
package
Algorithm
.
leetcode
.
Array
;
import
java
.
util
.
ArrayList
;
import
java
.
util
.
HashSet
;
import
java
.
util
.
List
;
import
java
.
util
.
Set
;
/**
*
* Created by tujietg on Nov 8, 2019
*/
public
class
No448
{
public
static
List
<
Integer
>
findDisappearedNumbers
(
int
[]
nums
) {
List
<
Integer
>
list
=
new
ArrayList
<
Integer
>();
Set
<
Integer
>
hashSet
=
new
HashSet
<
Integer
>();
for
(
int
i
=
0
;
i
<
nums
.
length
;
i
++) {
hashSet
.
add
(
nums
[
i
]);
}
int
n
=
nums
.
length
;
for
(
int
i
=
1
;
i
<=
n
;
i
++) {
if
(!
hashSet
.
contains
(
i
)) {
list
.
add
(
i
);
}
}
return
list
;
}
public
static
void
main
(
String
[]
args
) {
int
[]
param
=
new
int
[] {
4
,
3
,
2
,
7
,
8
,
2
,
3
,
1
};
findDisappearedNumbers
(
param
);
}
}
Back
|
FazBrowse Home
|
New Git URL