feature-test: added the cut lengths for dp rod cut

Author: Debashis08

include/0005_DynamicProgramming/0001_RodCutting.h

@@ -8,12 +8,12 @@ namespace RodCutting
 	class DynamicProgramming
 	{
 	private:
-		int _length;
+		int _totalLength;
 		vector<int> _price;
 		vector<int> _cutPositions;
 	public:
-		DynamicProgramming(int length, vector<int> price);
+		DynamicProgramming(vector<int> price);
 		int RecursiveRodCutting(int length);
-		pair<int, vector<int>> DpGetMaximumProfitWithCuts();
+		pair<int, vector<int>> DpGetMaximumProfitWithCuts(int length);
 	};
 }

source/0005_DynamicProgramming/0001_RodCutting.cc

@@ -5,10 +5,10 @@ using namespace std;
 
 namespace RodCutting
 {
-	DynamicProgramming::DynamicProgramming(int length, vector<int> price)
+	DynamicProgramming::DynamicProgramming(vector<int> price)
 	{
-		this->_length = length;
 		this->_price = price;
+		this->_totalLength = this->_price.size();
 	}
 
 	int DynamicProgramming::RecursiveRodCutting(int length)
@@ -29,13 +29,13 @@ namespace RodCutting
 		return result;
 	}
 
-	pair<int, vector<int>> DynamicProgramming::DpGetMaximumProfitWithCuts()
+	pair<int, vector<int>> DynamicProgramming::DpGetMaximumProfitWithCuts(int length)
 	{
 		vector<int> dp(this->_price.size() + 1, 0);
 		this->_cutPositions = vector<int>(this->_price.size() + 1, 0);
 
 		// Find maximum value for all rod of length i.
-		for (int i = 1; i <= this->_length; i++)
+		for (int i = 1; i <= this->_totalLength; i++)
 		{
 			for (int j = 1; j <= i; j++)
 			{
@@ -48,8 +48,14 @@ namespace RodCutting
 		}
 
 		// Re-construct the cuts
+		vector<int> cutLengths;
+		int currentLength = length;
+		while (currentLength > 0)
+		{
+			cutLengths.push_back(this->_cutPositions[currentLength] + 1);
+			currentLength -= cutLengths.back();
+		}
 
-
-		return { dp[this->_length] ,{} };
+		return { dp[length] ,cutLengths };
 	}
 }

test/0005_DynamicProgramming/0001_RodCuttingTest.cc

@@ -9,30 +9,32 @@ namespace RodCutting
 	TEST(DpRodCutting, RecursiveTest)
 	{
 		// Arrange
+		vector<int> price = { 1, 5, 8, 9, 10, 17, 17, 20, 24, 30 };
 		int length = 8;
-		vector<int> price = { 1, 5, 8, 9, 10, 17, 17, 20 };
-		DynamicProgramming dp(length, price);
+		DynamicProgramming dp(price);
 		int expectedResult = 22;
 
 		// Act
 		int actualResult = dp.RecursiveRodCutting(length);
 
 		// Assert
-		EXPECT_EQ(actualResult, expectedResult);
+		ASSERT_EQ(actualResult, expectedResult);
 	}
 
 	TEST(DpRodCutting, DpTest)
 	{
 		// Arrange
+		vector<int> price = { 1, 5, 8, 9, 10, 17, 17, 20, 24, 30 };
 		int length = 8;
-		vector<int> price = { 1, 5, 8, 9, 10, 17, 17, 20 };
-		DynamicProgramming dp(length, price);
-		int expectedResult = 22;
+		DynamicProgramming dp(price);
+		int expectedProfit = 22;
+		vector<int> expectedCuts = { 2, 6 };
 
 		// Act
-		pair<int, vector<int>> actualResult = dp.DpGetMaximumProfitWithCuts();
+		pair<int, vector<int>> actualResult = dp.DpGetMaximumProfitWithCuts(length);
 
 		// Assert
-		EXPECT_EQ(actualResult.first, expectedResult);
+		ASSERT_EQ(actualResult.first, expectedProfit);
+		ASSERT_EQ(actualResult.second, expectedCuts);
 	}
 }