leetcode-第一场双周赛-5009. 校园自行车分配 II-C语言

/*
 * 算法思想：
 * 1. 回溯解决排列组合的问题；
 * 2. 满足条件时计算当前结果，如果小于之前最小值，则更新最小值；
 * 3. 会超时。
 *
 */



inline int abs(int a){
    return a>0 ? a: -a;
}

typedef struct {
    int index; 
    int cnt;
} Node;

inline int get_dis(int **wks, int i, int **bikes, int j){
    return abs(wks[i][0] - bikes[j][0]) + abs(wks[i][1] - bikes[j][1]);
}

inline int get_ret(int **wks, int wsize, int **bikes, int bsize, int *stack, Node arr[bsize][wsize], int ret){
    int i;
    int cnt = 0;
    
    for(i=0; i ret){
            return cnt;
        }
    }

    return cnt;
}
void print_arr(int *arr, int len){
    int i;
    for(i=0; ilen || stack_index > stack_size) return;
    int i, tmp = 0;
    
    if(stack_index == stack_size){
        tmp = get_ret(wks, stack_size, bikes, len, stack, arr, *min);
        //print_arr(stack, stack_size);
        //printf("tmp = %d\n", tmp);
        if(tmp < *min){
            *min = tmp;
        }
        return;
    }
    
    for(i=0; icnt - a->cnt;
}

int assignBikes(int** wks, int ws, int* workersColSize, int** bikes, int bs, int* bikesColSize){
    int stack[ws];
    int vst[bs];
    int stack_index = 0;
    int min = INT_MAX;
    int i, j, cnt;
    Node bikes_dis[bs][ws];
    
    memset(vst, 0 ,sizeof(vst));
    
    #if 1
    for(i=0; i