algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0343.整数拆分.md

Browse Source 
Comment 错了
This commit is contained in:
Jamie He
2024-03-10 02:43:38 +00:00
committed by GitHub
parent 3bc9d8eb56
commit dd80ba7af9
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0343.整数拆分.md
View File

@ -296,7 +296,7 @@ class Solution:
def integerBreak(self, n):
if n == 2: # 当n等于2时，只有一种拆分方式：1+1=2，乘积为1
return 1
if n == 3: # 当n等于3时，只有一种拆分方式：1+1+1=3，乘积为1
if n == 3: # 当n等于3时，只有一种拆分方式：2+1=3，乘积为2
return 2
if n == 4: # 当n等于4时，有两种拆分方式：2+2=4和1+1+1+1=4，乘积都为4
return 4