May 15, 2023 · Mar 30, 2023 · Apr 25, 2023 · Apr 28, 2023 · May 15, 2023 · May 15, 2023
diff --git a/problems/0343.整数拆分.md b/problems/0343.整数拆分.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -254,7 +254,7 @@ class Solution:
		# 假设对正整数 i 拆分出的第一个正整数是 j(1 <= j < i),则有以下两种方案:
		# 1) 将 i 拆分成 j 和 i−j 的和,且 i−j 不再拆分成多个正整数,此时的乘积是 j * (i-j)
		# 2) 将 i 拆分成 j 和 i−j 的和,且 i−j 继续拆分成多个正整数,此时的乘积是 j * dp[i-j]
	for j in range(1, i / 2 + 1):
	for j in range(1, i // 2 + 1):
		dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]))
		return dp[n]
		```
Expand Down