计算两个数组中不是commen的元素数

问题描述

现在哪个逻辑可以包含在distinctElementCount方法中

now which logic can include in distinctElementCount method

int distinctElementCount(int *arr1, int *arr2, int len1, int len2)
{
    // COUNT ELEMENTS WHICH ARE NOT COMMON IN BOTH THE ARRAYS
    // WRITE YOUR CODE HERE
}
// FUNCTION SIGNATURE ENDS

// DO NOT IMPLEMENT THE main( ) METHOD
int main()
{
    // DO NOT CHANGE ANY CODE IN THIS FUNCTION
    int len1,len2;
    int result;
    int arr1[len1];
    int arr2[len2];
    //ASSUME INPUT HAVE ALREADY BEEN TAKEN
    result = distinctElementCount(arr1,arr2,len1,len2);
    return 0;
}
int distinctElementCount(arr1,arr2,len1,len2)
{

}

推荐答案

这篇关于计算两个数组中不是commen的元素数的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！