摘要：
int findDuplicate(int* nums, int numsSize){ int max=0, i; int *map; for (i=0; i<numsSize; ++i) { max = max>nums[i]?max:nums[i]; } map = malloc(sizeof( 阅读全文
摘要：
char * getHint(char * secret, char * guess){ if (secret == NULL || guess == NULL) { return "0A0B"; } int len, i, bulls=0, cows=0; int nums1[10]={0}, n 阅读全文