Added last three homeworks
This commit is contained in:
parent
f7b2367bc4
commit
0e3d948c9f
363 changed files with 18214 additions and 0 deletions
39
2025.02.21/6Ex/solve.c
Normal file
39
2025.02.21/6Ex/solve.c
Normal file
|
@ -0,0 +1,39 @@
|
|||
#include "solve.h"
|
||||
|
||||
int t6_solve(char ** a, int n, char *s) {
|
||||
int i, j, k;
|
||||
for (i = 0, j = 0, k = 0; i < n; ++i) {
|
||||
if (strpbrk(a[i], s)) {
|
||||
if (k > 1)
|
||||
{
|
||||
for (int x = 2; x < k; x++) free(a[i - x]);
|
||||
a[j++] = a[i - 1];
|
||||
}
|
||||
|
||||
if (i != j)
|
||||
{
|
||||
a[j] = a[i];
|
||||
}
|
||||
j++;
|
||||
k = 0;
|
||||
} else {
|
||||
if (k == 0) {
|
||||
if (i != j)
|
||||
a[j] = a[i];
|
||||
j++;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
}
|
||||
|
||||
if (k > 1)
|
||||
{
|
||||
for (int x = 2; x < k; x++) free(a[i - x]);
|
||||
a[j++] = a[i - 1];
|
||||
}
|
||||
|
||||
for (i = j; i < n; ++i) a[i] = 0;
|
||||
|
||||
return j;
|
||||
}
|
||||
|
Loading…
Add table
Add a link
Reference in a new issue