algo recursive fonctionne manque le tris des mini listes

This commit is contained in:
hugogogo
2021-09-25 17:19:07 +02:00
parent 38a5a88d8a
commit 115c03b8ca
9 changed files with 154 additions and 86 deletions

View File

@@ -7,22 +7,21 @@ char *fill_line(t_stack *list, char *stack)
if (list->limit == 1)
stack = ft_strjoinfree(ft_strdup("]"), stack);
stack = ft_strjoinfree(ft_itoa(list->n), stack);
if (list->limit == 1)
stack = ft_strjoinfree(ft_strdup("["), stack);
stack = ft_strjoinfree(ft_strdup(" "), stack);
list = list->next;
}
return (stack);
}
void mark_step(t_list *solution)
void mark_step(t_list *solution, char *step)
{
char *line;
while (solution->next != NULL)
solution = solution->next;
line = solution->content;
line = ft_strjoinfree(line, ft_strdup("!1"));
line = ft_strjoinfree(line, ft_strdup("!"));
line = ft_strjoinfree(line, ft_strdup(step));
solution->content = line;
}
@@ -62,6 +61,28 @@ void fill_solution(t_list *solution, char *sp)
ft_lstadd_back(&solution, ft_lstnew(stack));
}
// some drafty code to print sublist with flag
void print_flags(char **part, int flag)
{
int last_a;
int last_b;
last_a = part[1][ft_strlen(part[1]) - 1];
last_b = part[0][ft_strlen(part[0]) - 1];
if (flag && part[3] != NULL)
ft_printf(" ( %s )", part[3]);
if (flag == 1 || (flag == 2 && part[3] != NULL))
{
ft_printf("\n %s", part[1]);
if (part[3] != NULL && last_a != ']')
ft_putchar(']');
ft_printf("\n %s", part[0]);
if (part[3] != NULL && last_b != ']' && last_b != ':')
ft_putchar(']');
}
}
void print_result(t_list *result, int flag)
{
int i;
@@ -73,12 +94,9 @@ void print_result(t_list *result, int flag)
{
i++;
part = ft_split(result->content, '!');
ft_printf("%s\n", part[2]);
if (flag == 1 || (flag == 2 && part[3] != NULL))
{
ft_printf(" %s\n", part[1]);
ft_printf(" %s\n", part[0]);
}
ft_printf("%s", part[2]);
print_flags(part, flag);
ft_putchar('\n');
result = result->next;
free(part[0]);
free(part[1]);