mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 07:35:35 +08:00
@ -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
|
||||
|
Reference in New Issue
Block a user