Fix formatting issues in LongestIncreasingSubsequenceNLogN class and its test class

Author: huseynovvusal

src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequenceNLogN.java

@@ -21,7 +21,8 @@ private LongestIncreasingSubsequenceNLogN() {
      * @return The index of the lower bound.
      */
     private static int lowerBound(int[] arr, int target, int size) {
-        int l = 0, r = size;
+        int l = 0;
+        int r = size;
 
         while (l < r) {
             int mid = l + (r - l) / 2;

src/test/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequenceNLogNTest.java

@@ -19,4 +19,4 @@ private static Stream<Arguments> provideTestCases() {
     public void testLengthOfLIS(int[] input, int expected) {
         assertEquals(expected, LongestIncreasingSubsequenceNLogN.lengthOfLIS(input));
     }
-}
+}