Update Q-07: Partition Array for Maximum Sum.java

Author: py3-coder

DP MCM Pattern/Q-07: Partition Array for Maximum Sum.java

@@ -91,4 +91,29 @@ public static int solveMemo(int arr[],int k,int i,int j){
         memo[i][j]=ans;
         return ans;
     }
+   public int solveTab(int[] arr,int k){
+        int n = arr.length;
+        int[][] dp = new int[n+1][n+1];
+        
+        for(int i=n-1;i>=0;i--){
+            for(int j=0;j<n;j++){
+                if(i==j) dp[i][j]=arr[i];
+                else if(j-i+1<=k){
+                    int max=0;
+                    for(int x=i;x<=j;x++){
+                        max= Math.max(max,arr[x]);
+                    }
+                    dp[i][j] = max*(j-i+1);
+                }else{
+                    int maxi = 0;
+                    for(int p=i;p<j && p<i+k;p++){
+                        int res = dp[i][p]+dp[p+1][j];
+                        maxi = Math.max(maxi,res);
+                    }
+                    dp[i][j]=maxi;
+                }
+            }
+        }
+        return dp[0][n-1];
+    }
 }