Comparison of the similarities and differences of Huawei machine test-elements

Enter two shaped arrays to find out the number of unequal positions in the two arrays.

    #include <iostream> using namespace std;          int diff_num (int arr1[],int len1,int arr2[],int len2) {int num=0;          int i=len1-1;          int j=len2-1;          int k= (LEN1&LT;LEN2)? Len1:len2;          k--;                  while (k>=0) {if (Arr1[i]!=arr2[j]) {num++;                  i--;                  j--;              k--;                  } else {i--;                  j--;              k--;      }} return num;          } int main () {int arr1[100];          int arr2[100];                int a,k=0,b,l=0;          cin>>a;              while (GetChar ()! = ' \ n ') {arr1[k++]=a;          cin>>a;                } arr1[k++]=a;          cin>>b;              while (GetChar ()! = ' \ n ') {arr2[l++]=b;          cin>>b;       }   Arr2[l++]=b;          Cout<<diff_num (arr1,k,arr2,l) <<endl;      return 0;   }

Comparison of the similarities and differences of Huawei machine test-elements