【leetcode】访问所有点的最小时间

int minTimeToVisitAllPoints(int** points, int pointsSize, int* pointsColSize){
    int sum=0,i;
    for (i=0; i<pointsSize-1; i++)
    {
        sum+= fmax(abs(points[i][0]-points[i+1][0]),abs(points[i][1]-points[i+1][1]));
    }
    return sum;
}