1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
|
static char * DestructionTousEspaces ( char * chaine)
{
int i;
for(i=0;chaine[i];i++)
if (chaine[i]==' ')
chaine[i]=chaine[i+1];
return chaine;
}
static char * DestuctionEspacesEnTete ( char * chaine)
{
int i;
for(i=0;*(chaine+i)==' ';i++)
*(chaine+i)=*(chaine+i+1);
return chaine;
}
static char * DestructionEspaceEnFin ( char * chaine)
{
int i;
for(i=0;*(chaine+i);i++)
;
for(;*(chaine+i)==' ';i--)
*(chaine+i)=*(chaine+i-1);
return chaine;
}
int main (void)
{
struct test
{
char s_in[8];
char const *s_out;
};
struct test a1[]
=
{
{"", ""},
{" ", ""},
{" ", ""},
{" a", "a"},
{" a ", "a"},
{" a b", "ab"},
{"a b", "ab"},
{"ab", "ab"},
};
#define N(a) (sizeof(a)/sizeof *(a))
size_t i;
for(i=0; i < N(a1); i++)
{
struct test *p = a1+i;
char * s_out = DestructionTousEspaces ( p->s_in);
if (strcmp(s_out, p->s_out) != 0)
{
printf ("error at line %u\n", i+1);
break;
}
if (i == N(a1))
{
puts("\np a s s e d");
}
}
return 0;
} |
Partager