Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here's your problem today. This problem was recently asked by Apple:

Given an array of numbers, determine whether it can be partitioned into 3 arrays of equal sums.

For instance, [0, 2, 1, -6, 6, -7, 9, 1, 2, 0, 1] can be partitioned into: [0, 2, 1], [-6, 6, -7, 9, 1], [2, 0, 1] all of which sum to 3.

class Solution(object): def canThreePartsEqualSum(self, A): # Fill this in.0

print(Solution().canThreePartsEqualSum( [0, 2, 1, -6, 6, -7, 9, 1, 2, 0, 1]))

True