refactor code

Author: codejsha

cpp-algorithm/src/dynamic_programming/fibonacci_number.cpp

@@ -2,18 +2,18 @@
 
 auto Fibonacci::FibonacciDynamicTopDown(const int number, std::vector<int>& memo) -> int
 {
-    if (number <= 0) { return 0; }
+    if (number == 0) { return 0; }
     if (number == 1) { return 1; }
     if (memo[number] > 0) { return memo[number]; }
 
     memo[number] = FibonacciDynamicTopDown(number - 1, memo) + FibonacciDynamicTopDown(number - 2, memo);
-    
+
     return memo[number];
 }
 
 auto Fibonacci::FibonacciDynamicBottomUp(const int number) -> int
 {
-    if (number <= 0) { return 0; }
+    if (number == 0) { return 0; }
     if (number == 1) { return 1; }
 
     std::vector<int> memo(number + 1, -1);

java-algorithm/src/test/java/com/example/algorithm/math/IntegerFactorizationTest.java

@@ -5,7 +5,6 @@
 import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 
 class IntegerFactorizationTest {
-
     @Test
     void factorizeValidInput() {
         var number = 90;