【leetcode】通过翻转子数组使两个数组相等

 

bool canBeEqual(int* target, int targetSize, int* arr, int arrSize){
    int i,val=0,sum=0;
    for (i=0; i<targetSize; i++)
    {
        sum += target[i] - arr[i];
        val ^= target[i] ^ arr[i];
    }
    return (val==0 && sum==0 )? true: false;
}