【剑指】14.剪绳子

最新推荐文章于 2022-10-15 12:18:35 发布

YTea

最新推荐文章于 2022-10-15 12:18:35 发布

阅读量111

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/ansizhong9191/article/details/80402928

版权

剑指offer 专栏收录该内容

81 篇文章 0 订阅

订阅专栏

题目描述

给你一根长度为n绳子，请把绳子剪成m段（m、n都是整数，n>1并且m≥1）。每段的绳子的长度记为k[0]、k[1]、……、k[m]。k[0]*k[1]*…*k[m]可能的最大乘积是多少？例如当绳子的长度是8时，我们把它剪成长度分别为2、3、3的三段，此时得到最大的乘积18。
PS：本题无线上测试。

算法分析

动态规划法：f(n)=max(f(i)*f(n-i));
贪婪发：尽可能多的剪长度为3的绳子，剩下的绳子如果长度为4，则剪成长度为2的2段；

提交代码：

/*
贪婪算法
*/
int maxProductAfterCutting_solution1(int length)
{
	if (length < 2)
		return 0;
	if (length == 2)
		return 1;
	if (length == 3)
		return 2;

	int len2cnt = 0, len3cnt = 0;
	len3cnt = length / 3;
	if ((length - 3 * len3cnt) == 1)
		--len3cnt;

	len2cnt = (length - 3 * len3cnt) / 2;

	return pow(3, len3cnt) * pow(2, len2cnt);

}

/* 动态规划法 */
int maxProductAfterCutting_solution2(int length)
{
	if (length < 2)
		return 0;
	if (length == 2)
		return 1;
	if (length == 3)
		return 2;
	// 最优子解
	int *pre = new int[length + 1];
	pre[0] = 0;
	pre[1] = 1;
	pre[2] = 2;
	pre[3] = 3;

	int max = 0;

	for (int i = 4; i <= length; ++i)
	{
		max = 0;
		for (int j = 0; j <= i / 2; ++j)
		{
			int value = pre[j] * pre[i - j];
			if (value > max)
				max = value;
		}
		pre[i] = max;
	}

	max = pre[length];

	delete[] pre;

	return max;
}

测试代码：

// ====================测试代码====================
void test(const char* testName, int length, int expected)
{
	int result1 = maxProductAfterCutting_solution1(length);
	if (result1 == expected)
		std::cout << "Solution1 for " << testName << " passed." << std::endl;
	else
		std::cout << "Solution1 for " << testName << " FAILED." << std::endl;

	int result2 = maxProductAfterCutting_solution2(length);
	if (result2 == expected)
		std::cout << "Solution2 for " << testName << " passed." << std::endl;
	else
		std::cout << "Solution2 for " << testName << " FAILED." << std::endl;
}

void test1()
{
	int length = 1;
	int expected = 0;
	test("test1", length, expected);
}

void test2()
{
	int length = 2;
	int expected = 1;
	test("test2", length, expected);
}

void test3()
{
	int length = 3;
	int expected = 2;
	test("test3", length, expected);
}

void test4()
{
	int length = 4;
	int expected = 4;
	test("test4", length, expected);
}

void test5()
{
	int length = 5;
	int expected = 6;
	test("test5", length, expected);
}

void test6()
{
	int length = 6;
	int expected = 9;
	test("test6", length, expected);
}

void test7()
{
	int length = 7;
	int expected = 12;
	test("test7", length, expected);
}

void test8()
{
	int length = 8;
	int expected = 18;
	test("test8", length, expected);
}

void test9()
{
	int length = 9;
	int expected = 27;
	test("test9", length, expected);
}

void test10()
{
	int length = 10;
	int expected = 36;
	test("test10", length, expected);
}

void test11()
{
	int length = 50;
	int expected = 86093442;
	test("test11", length, expected);
}

int main(int agrc, char* argv[])
{
	test1();
	test2();
	test3();
	test4();
	test5();
	test6();
	test7();
	test8();
	test9();
	test10();
	test11();

	return 0;
}