bug日记-bezier

cv::Point2f recursive_bezier(const std::vector<cv::Point2f> &control_points, float t) 
{
    // TODO: Implement de Casteljau's algorithm
    std::vector<cv::Point2f> new_control_points;
    cv::Point2f point(0.f,0.f);
    if (control_points.size() > 1) {
       
        for (int i = 0; i < control_points.size() - 1; i++) {
            cv::Point2f tmp( t * control_points[i].x + (1.f - t) * control_points[i + 1].x,
                t * control_points[i].y + (1.f - t) * control_points[i + 1].y );
            new_control_points.push_back(tmp);

        }
        return recursive_bezier(new_control_points,t);
//这个地方没写return会出现错误，返回值不准
    }
    else {
        point = control_points[0];
       // std::cout << point << std::endl;
        return point;
    }
   

}

在递归函数中，该函数有返回值，则在本函数中，调用该函数的前面都必须要加return，千万别忘了