mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-28 15:02:46 +08:00
style: enable MethodName
in CheckStyle (#5182)
enabled: MethodName in CheckStyle
This commit is contained in:

committed by
GitHub

parent
ea4dc15a24
commit
295e7436b1
@ -11,6 +11,6 @@ class CountCharTest {
|
||||
String input = "12345";
|
||||
int expectedValue = 5;
|
||||
|
||||
assertEquals(expectedValue, CountChar.CountCharacters(input));
|
||||
assertEquals(expectedValue, CountChar.countCharacters(input));
|
||||
}
|
||||
}
|
||||
|
@ -10,48 +10,48 @@ public class KadaneAlogrithmTest {
|
||||
@Test
|
||||
void testForOneElement() {
|
||||
int[] a = {-1};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, -1));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, -1));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForTwoElements() {
|
||||
int[] a = {-2, 1};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, 1));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, 1));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForThreeElements() {
|
||||
int[] a = {5, 3, 12};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, 20));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, 20));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForFourElements() {
|
||||
int[] a = {-1, -3, -7, -4};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, -1));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, -1));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForFiveElements() {
|
||||
int[] a = {4, 5, 3, 0, 2};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, 14));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, 14));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForSixElements() {
|
||||
int[] a = {-43, -45, 47, 12, 87, -13};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, 146));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, 146));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForSevenElements() {
|
||||
int[] a = {9, 8, 2, 23, 13, 6, 7};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, 68));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, 68));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testForEightElements() {
|
||||
int[] a = {9, -5, -5, -2, 4, 5, 0, 1};
|
||||
assertTrue(KadaneAlgorithm.max_Sum(a, 10));
|
||||
assertTrue(KadaneAlgorithm.maxSum(a, 10));
|
||||
}
|
||||
}
|
||||
|
@ -25,6 +25,6 @@ public class LineSweepTest {
|
||||
@Test
|
||||
void testForMaximumEndPoint() {
|
||||
int[][] arr = {{10, 20}, {1, 100}, {14, 16}, {1, 8}};
|
||||
assertEquals(100, LineSweep.FindMaximumEndPoint(arr));
|
||||
assertEquals(100, LineSweep.findMaximumEndPoint(arr));
|
||||
}
|
||||
}
|
||||
|
@ -6,27 +6,27 @@ import org.junit.jupiter.api.Test;
|
||||
|
||||
public class MaximumSumOfDistinctSubarraysWithLengthKTest {
|
||||
@Test
|
||||
public void SampleTestCase1() {
|
||||
public void sampleTestCase1() {
|
||||
assertEquals(15, MaximumSumOfDistinctSubarraysWithLengthK.maximumSubarraySum(3, 1, 5, 4, 2, 9, 9, 9));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void SampleTestCase2() {
|
||||
public void sampleTestCase2() {
|
||||
assertEquals(0, MaximumSumOfDistinctSubarraysWithLengthK.maximumSubarraySum(3, 4, 4, 4));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void SampleTestCase3() {
|
||||
public void sampleTestCase3() {
|
||||
assertEquals(12, MaximumSumOfDistinctSubarraysWithLengthK.maximumSubarraySum(3, 9, 9, 9, 1, 2, 3));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void EdgeCase1() {
|
||||
public void edgeCase1() {
|
||||
assertEquals(0, MaximumSumOfDistinctSubarraysWithLengthK.maximumSubarraySum(0, 9, 9, 9));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void EdgeCase2() {
|
||||
public void edgeCase2() {
|
||||
assertEquals(0, MaximumSumOfDistinctSubarraysWithLengthK.maximumSubarraySum(5, 9, 9, 9));
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user