Skip to content

Added Javadoc comments: I added Javadoc-style comments to provide doc… #4745

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Nov 11, 2023
Merged

Added Javadoc comments: I added Javadoc-style comments to provide doc… #4745

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e4a942d
Added Javadoc comments: I added Javadoc-style comments to provide doc…
sunilnitdgp Oct 9, 2023
c7535bc
Removed main method
sunilnitdgp Oct 11, 2023
193ab95
Merge branch 'master' into patch-11
debasishbsws Nov 11, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 21 additions & 16 deletions src/main/java/com/thealgorithms/dynamicprogramming/RodCutting.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,32 +1,37 @@
package com.thealgorithms.dynamicprogramming;

/**
* A DynamicProgramming solution for Rod cutting problem Returns the best
* obtainable price for a rod of length n and price[] as prices of different
* pieces
* A Dynamic Programming solution for the Rod cutting problem.
* Returns the best obtainable price for a rod of length n and price[] as prices of different pieces.
*/
public class RodCutting {

private static int cutRod(int[] price, int n) {
/**
* This method calculates the maximum obtainable value for cutting a rod of length n
* into different pieces, given the prices for each possible piece length.
*
* @param price An array representing the prices of different pieces, where price[i-1]
* represents the price of a piece of length i.
* @param n The length of the rod to be cut.
* @return The maximum obtainable value.
*/
public static int cutRod(int[] price, int n) {
// Create an array to store the maximum obtainable values for each rod length.
int[] val = new int[n + 1];
val[0] = 0;

// Calculate the maximum value for each rod length from 1 to n.
for (int i = 1; i <= n; i++) {
int max_val = Integer.MIN_VALUE;
for (int j = 0; j < i; j++) {
max_val = Math.max(max_val, price[j] + val[i - j - 1]);
int maxVal = Integer.MIN_VALUE;
// Try all possible ways to cut the rod and find the maximum value.
for (int j = 1; j <= i; j++) {
maxVal = Math.max(maxVal, price[j - 1] + val[i - j]);
}

val[i] = max_val;
// Store the maximum value for the current rod length.
val[i] = maxVal;
}

// The final element of 'val' contains the maximum obtainable value for a rod of length 'n'.
return val[n];
}

// main function to test
public static void main(String[] args) {
int[] arr = new int[] {2, 5, 13, 19, 20};
int result = cutRod(arr, arr.length);
System.out.println("Maximum Obtainable Value is " + result);
}
}