Number of ways of splitting array in 3 partitions with equal sum

前端 未结 0 709
忘掉有多难
忘掉有多难 2020-12-22 14:39

Count the number of ways to split all the elements of the array into 3 contiguous parts so that the sum of elements in each part is the same.

A = [1, 2, 3, 0, 3]

相关标签:
回答
  • 消灭零回复
提交回复
热议问题