擅长:python、mysql、java
<p>你患的是<code>0-based indexing</code>计算综合症</p>
<p>计算机科学有时使用{<cd1>},而数学似乎使用基于1的索引</p>
<p>此程序似乎为您提供了预期的输出:</p>
<pre class="lang-py prettyprint-override"><code>def optimal_partition():
TE=[10,1,3]
TC=[2,3,1]
TU=[2,3,1]
N = len(TU) - 1
SUMS = [0] * N
for j in range(N):
for i in range(j + 1):
SUMS[j] += TE[i]
for k in range(j + 1, N + 1):
SUMS[j] += TC[k]
SUMS[j] += TU[j]
return SUMS
SUMS = optimal_partition()
print(SUMS)
print(SUMS.index(min(SUMS)))
</code></pre>
<p>输出:</p>
<pre><code>[16, 15]
1
</code></pre>