动态规划: dp = [0, 1, 2]
- 0: 对3 取余为 0 的最大和
- 1: 对3 取余为 1 的最大和
- 2: 对3 取余为 2 的最大和
0 1 2 为 dp 位置的值
0 = 1 + 2 % 3
1 = 0 + 1 % 3
2 = 0 + 2 % 3
class Solution(object):
def maxSumDivThree(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
dp = [0, float("-inf"), float("-inf")]
for n in nums:
i = n % 3
tmp = list(dp)
if i == 0:
dp[0] = max(tmp[0] + n, tmp[0])
dp[1] = max(tmp[1] + n, tmp[1])
dp[2] = max(tmp[2] + n, tmp[2])
elif i == 1:
dp[0] = max(tmp[2] + n, tmp[0])
dp[1] = max(tmp[0] + n, tmp[1])
dp[2] = max(tmp[1] + n, tmp[2])
elif i == 2:
dp[0] = max(tmp[1] + n, tmp[0])
dp[1] = max(tmp[2] + n, tmp[1])
dp[2] = max(tmp[0] + n, tmp[2])
return dp[0]