mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-05 16:27:33 +08:00
Format code with prettier (#3375)
This commit is contained in:
@ -1,4 +1,5 @@
|
||||
package com.thealgorithms.dynamicprogramming;
|
||||
|
||||
// Partition a set into two subsets such that the difference of subset sums is minimum
|
||||
|
||||
/*
|
||||
@ -81,8 +82,8 @@ public class MinimumSumPartition {
|
||||
* Driver Code
|
||||
*/
|
||||
public static void main(String[] args) {
|
||||
assert subSet(new int[]{1, 6, 11, 5}) == 1;
|
||||
assert subSet(new int[]{36, 7, 46, 40}) == 23;
|
||||
assert subSet(new int[]{1, 2, 3, 9}) == 3;
|
||||
assert subSet(new int[] { 1, 6, 11, 5 }) == 1;
|
||||
assert subSet(new int[] { 36, 7, 46, 40 }) == 23;
|
||||
assert subSet(new int[] { 1, 2, 3, 9 }) == 3;
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user