leetcode-888-公平的糖果交换-C语言

/**
 * 解法1：
 * 暴力法
 */
int* fairCandySwap_bak(int* A, int ASize, int* B, int BSize, int* returnSize){
    int cnt1 = 0;
    int cnt2 = 0;
    int i, j;
    int *ret = (int *)malloc(sizeof(int) *2);
    
    ret[0] = 100;
    ret[1] = 200;
    *returnSize = 2;
    
    for(i=0; i=LEN) continue;
        if(arr[tmp]){
            ret[0] = A[i];
            ret[1] = tmp;
            return ret;            
        }

    }
    
    return ret;
}