leetcode-573. 松鼠模拟-C语言

int dis(int *x, int *y){
    return abs(x[0]-y[0]) + abs(x[1]-y[1]);
}

int minDistance(int height, int width, int* tree, int treeSize, 
                int* squirrel, int squirrelSize, int** nuts, int nutsSize, int* nutsColSize){
    int i, tmp, min=INT_MAX, tree_dis[nutsSize], cnt = 0, min_tree, cnt_bak;
    
    for(i=0; i<nutsSize; i++){
        tree_dis[i] = dis(tree, nuts[i]);
        cnt += tree_dis[i];
    }
    
    cnt *= 2;
    
    for(i=0; i<nutsSize; i++){
        cnt -= tree_dis[i];
        
        cnt += dis(squirrel, nuts[i]);
        if(cnt < min){
            min = cnt;
            printf("min = %d\n", min);
        }
        
        cnt -= dis(squirrel, nuts[i]);
        cnt += tree_dis[i];
    }
    
    return min;
}