FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_1/LeetCode_698_1.java 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_01
/
id_1
/
LeetCode_698_1.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
56 lines (39 loc) · 1.08 KB
Breadcrumbs
algorithm
/
Week_01
/
id_1
/
LeetCode_698_1.java
Copy path
File metadata and controls
56 lines (39 loc) · 1.08 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
public
class
Solution
{
private
int
average
;
private
boolean
[]
mark
;
public
boolean
canPartitionKSubsets
(
int
[]
nums
,
int
k
) {
if
(
k
==
1
) {
return
true
;
}
int
sum
=
0
;
int
len
=
nums
.
length
;
for
(
int
i
=
0
;
i
<
len
;
i
++) {
sum
+=
nums
[
i
];
}
if
(
sum
%
k
!=
0
) {
return
false
;
}
this
.
average
=
sum
/
k
;
mark
=
new
boolean
[
len
];
return
calSubSum
(
nums
,
0
,
average
,
0
,
k
);
}
public
boolean
calSubSum
(
int
[]
nums
,
int
curSum
,
int
subSum
,
int
start
,
int
k
) {
if
(
k
==
1
) {
return
true
;
}
if
(
curSum
==
subSum
) {
return
calSubSum
(
nums
,
0
,
subSum
,
0
,
k
-
1
);
}
for
(
int
i
=
start
;
i
<
nums
.
length
;
i
++) {
if
(
mark
[
i
]) {
continue
;
}
mark
[
i
] =
true
;
if
(
this
.
calSubSum
(
nums
,
curSum
+
nums
[
i
],
subSum
,
i
+
1
,
k
)) {
return
true
;
}
mark
[
i
] =
false
;
}
return
false
;
}
}
Back
|
FazBrowse Home
|
New Git URL