2nd_Sem_Bogachev/2025.05.23/dist/Krivoruchenko_SK/solve_03.c
2025-05-19 20:33:04 +03:00

32 lines
451 B
C

#include "solve_03.h"
#include "node.h"
#include <string.h>
int t3_solve (node *head)
{
char *last = head->string;
int count = 0, local = 1;
for (head = head->next; head; head = head->next)
{
int cmp = strcmp(head->string, last);
if (cmp < 0) {
if (local) {
count += local;
local = 0;
}
} else if (cmp == 0) {
if (local)
local++;
} else
local = 1;
last = head->string;
}
count += local;
return count;
}