#include "solve_02.h"
#include "node.h"

#include <string.h>

int t2_solve (node *head)
{
	char *last = head->string;
	int count = 1;

	for (head = head->next; head; head = head->next)
	{
		if (strcmp(head->string, last) > 0) 
			count++;
		last = head->string;
	}

	return count;
}