day 39

LCP 01.猜数字

int game(int* guess, int guessSize, int* answer, int answerSize){
    int x=0;
    for(int i=0;i<3;i++){
        if(guess[i]==answer[i]){
            x++;
        }
    }
    return x;
}

1470.重新排列数组

int* shuffle(int* nums, int numsSize, int n, int* returnSize){
    int *ans=(int *)malloc(sizeof(int)*numsSize);
    for(int i=0;i<numsSize;i++){
        if(i<n){
            ans[2*i]=nums[i];
        }else{
            ans[(i-n)*2+1]=nums[i];
        }
    }
    *returnSize=numsSize;
    return ans;
}