Format: Google java formatter

Author: github-actions

DynamicProgramming/LongestCommonSubsequence/Solution.java

@@ -8,7 +8,6 @@
 /**
  * * Longest Common Subsequence (LCS) Problem
  */
-
 public class Solution {
   public int longestCommonSubsequence(String s1, String s2) {
     // return longestCommonSubsequenceRec(
@@ -19,7 +18,8 @@ public int longestCommonSubsequence(String s1, String s2) {
     // int[][] cache = new int[s1.length() + 1][s2.length() + 1];
     // for (int[] row : cache) Arrays.fill(row, -1);
 
-    // return longestCommonSubsequenceMem(s1.length(), s2.length(), s1.toCharArray(), s2.toCharArray(), cache);
+    // return longestCommonSubsequenceMem(s1.length(), s2.length(), s1.toCharArray(),
+    // s2.toCharArray(), cache);
 
     return longestCommonSubsequenceDP(s1, s2);
 
@@ -28,7 +28,7 @@ public int longestCommonSubsequence(String s1, String s2) {
 
   /**
    * * Dynamic Programming Approach (Space Optimized)
-   * 
+   *
    * * TC: O(mn)
    * * SC: O(n)
    */
@@ -38,7 +38,7 @@ public int longestCommonSubsequence(String s1, String s2) {
 
   //   for (int i = 1; i < m + 1; i++) {
   //     // Calculate whether the the
-  //     // current row is even/odd. 
+  //     // current row is even/odd.
   //     idx = i & 1;
   //     for (int j = 1; j < n + 1; j++) {
   //       if (s1.charAt(i - 1) == s2.charAt(j - 1))
@@ -56,7 +56,7 @@ public int longestCommonSubsequence(String s1, String s2) {
 
   /**
    * * Dynamic Programming Approach
-   * 
+   *
    * * TC: O(mn)
    * * SC: O(mn)
    */
@@ -66,13 +66,8 @@ private int longestCommonSubsequenceDP(String s1, String s2) {
 
     for (int i = 1; i < m + 1; i++) {
       for (int j = 1; j < n + 1; j++) {
-        if (s1.charAt(i - 1) == s2.charAt(j - 1))
-          dp[i][j] = 1 + dp[i - 1][j - 1];
-        else
-          dp[i][j] = Math.max(
-            dp[i - 1][j],
-            dp[i][j - 1]
-          );
+        if (s1.charAt(i - 1) == s2.charAt(j - 1)) dp[i][j] = 1 + dp[i - 1][j - 1];
+        else dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
       }
     }
 
@@ -91,8 +86,7 @@ private String buildSequence(String s1, String s2, int[][] dp) {
         seq.add(0, String.valueOf(s1.charAt(i - 1)));
         --i;
         --j;
-      }
-      else if (dp[i - 1][j] > dp[i][j - 1]) --i;
+      } else if (dp[i - 1][j] > dp[i][j - 1]) --i;
       else --j;
     }
 
@@ -101,7 +95,7 @@ private String buildSequence(String s1, String s2, int[][] dp) {
 
   /**
    * * Memoization Approach
-   * 
+   *
    * * TC: O(mn)
    * * SC: O(mn)
    */
@@ -121,7 +115,7 @@ private String buildSequence(String s1, String s2, int[][] dp) {
 
   /**
    * * Recursive Approach
-   * 
+   *
    * * TC: O(3^(m + n)) approximately
    * * SC: O(3^(m + n)) approximately
    */
@@ -146,4 +140,4 @@ public static void main(String[] args) {
     // should be 4
     System.out.println(solution.longestCommonSubsequence("AGGTAB", "GXTXAYB"));
   }
-}
+}