C Programming second Edition 2.4 exercises

#include <stdio.h>
/*
Rewrite Squeeze (s1,s2) to string S1 any characters in the string S2
The matching characters are deleted.
*/
#define MAX 10
Char C[max];

int main () {
Char A[max] = "ABCDEFG";
Char B[max] = "Abcdffe";
void Squeeze (char A[],char b[]);
Squeeze (A, b);
printf ("%s\n", c);
}void squeeze (char a[], char b[]) {

int i,j;
int k=0;
int count;
for (i=0;i<max;i++) {
count=0; is important
for (j=0;j<max;j++) {
if (a[i]! = B[j]) {//If the characters in a[i] are not equal to any of the characters in B[0]-b[9] count value plus 1
count++;
}
else count=0; Count clear 0 if a[i] is equal to an element in the middle of b[0]-b[9]
if (count = = 9) {//only a[i that can add count to 9] is not in the B array to put this character in the C "" Array
Count = 0;
C[k]=a[i];
k++;
}
}
}

C Programming second Edition 2.4 exercises