Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit34969d8

Browse files
refaactor 416
1 parent131ecfa commit34969d8

File tree

1 file changed

+0
-28
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-28
lines changed

‎src/main/java/com/fishercoder/solutions/_416.java

Lines changed: 0 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -2,34 +2,6 @@
22

33
importjava.util.Arrays;
44

5-
/**
6-
* 416. Partition Equal Subset Sum
7-
*
8-
* Given a non-empty array containing only positive integers,
9-
* find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
10-
11-
Note:
12-
13-
Each of the array element will not exceed 100.
14-
The array size will not exceed 200.
15-
16-
Example 1:
17-
18-
Input: [1, 5, 11, 5]
19-
20-
Output: true
21-
22-
Explanation: The array can be partitioned as [1, 5, 5] and [11].
23-
24-
25-
Example 2:
26-
27-
Input: [1, 2, 3, 5]
28-
29-
Output: false
30-
31-
Explanation: The array cannot be partitioned into equal sum subsets.
32-
*/
335
publicclass_416 {
346
publicstaticclassSolution1 {
357
/**

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp