寻找平衡点问题

int calcBalance(int arr[], int length)
{
    int *left = new int[length]; //left[i]为从第0个到第i-1个的和
    int *right = new int[length]; //right[i]为从第i+1个到第len-1个的和
    int b = length-1;
    for(int i=0; i<length; i++)
    {
    if(i == 0)   
            left[i] = 0;   
        else  
            left[i] = left[i-1]+arr[i-1];   
    }   
    for(; b>=0; b--)   
    {   
        if(b == length-1)   
            right[b] = 0;    
        else  
            right[b] = right[b+1]+arr[b+1];   
        if(left[b] == right[b])
        {
            delete[] left;
            delete[] right;
            return b;
        }
    }

    delete[] left;
    delete[] right;
    return -1;
}