Mod: Dynamic Programming - LIS & BB::maxLen defaults to 1

Author: alpha037

DynamicProgramming/BuildingBridges/Solution.java

@@ -29,7 +29,7 @@ public int buildingBridges(int[][] cityPairs) {
    * * SC: O(n)
    */
   private int longestIncreasingSubsequenceDP(int[][] cityPairs) {
-    int len = cityPairs.length, maxLen = Integer.MIN_VALUE;
+    int len = cityPairs.length, maxLen = 1;
     int[] dp = new int[len];
     Arrays.fill(dp, 1);
 
@@ -44,7 +44,7 @@ private int longestIncreasingSubsequenceDP(int[][] cityPairs) {
       }
     }
 
-    return dp[len - 1];
+    return maxLen;
   }
 
   /**

DynamicProgramming/LongestIncreasingSubsequence/Solution.java

@@ -26,7 +26,7 @@ public int longestIncreasingSubsequence(int[] items) {
    * * SC: O(n)
    */
   private int longestIncreasingSubsequenceDP(int[] items) {
-    int len = items.length, maxLen = Integer.MIN_VALUE, end = 0;
+    int len = items.length, maxLen = 1, end = 0;
     int[] dp = new int[len];
     Arrays.fill(dp, 1);