algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-08-02 06:03:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: format code (#4212)

Browse Source 
close #4204
This commit is contained in:
acbin
2023-06-09 18:52:05 +08:00
committed by GitHub
parent ad03086f54
commit 00282efd8b
521 changed files with 5233 additions and 7309 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/test/java/com/thealgorithms/dynamicprogramming/PartitionProblemTest.java
View File

@ -1,24 +1,24 @@
package com.thealgorithms.dynamicprogramming;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;
class PartitionProblemTest {
@Test
public void testIfSumOfTheArrayIsOdd(){
assertFalse(PartitionProblem.partition(new int[]{1, 2, 2}));
public void testIfSumOfTheArrayIsOdd() {
assertFalse(PartitionProblem.partition(new int[] {1, 2, 2}));
}
@Test
public void testIfSizeOfTheArrayIsOne(){
assertFalse(PartitionProblem.partition(new int[]{2}));
public void testIfSizeOfTheArrayIsOne() {
assertFalse(PartitionProblem.partition(new int[] {2}));
}
@Test
public void testIfSumOfTheArrayIsEven1(){
assertTrue(PartitionProblem.partition(new int[]{1, 2, 3, 6}));
public void testIfSumOfTheArrayIsEven1() {
assertTrue(PartitionProblem.partition(new int[] {1, 2, 3, 6}));
}
@Test
public void testIfSumOfTheArrayIsEven2(){
assertFalse(PartitionProblem.partition(new int[]{1, 2, 3, 8}));
public void testIfSumOfTheArrayIsEven2() {
assertFalse(PartitionProblem.partition(new int[] {1, 2, 3, 8}));
}
}