题意:
给定一个数组,找到一个索引点i,使【0,i】和【i+1,n】的方差和最小
D(x)=E(x2)-E(x)2
class Solution:
def find_best_cut(self,arr):
n = len(arr)
prex = [0]
prex2 = [
题意:
给定一个数组,找到一个索引点i,使【0,i】和【i+1,n】的方差和最小
D(x)=E(x2)-E(x)2
class Solution:
def find_best_cut(self,arr):
n = len(arr)
prex = [0]
prex2 = [