89 lines
2.0 KiB
C
89 lines
2.0 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* indexing.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: apommier <apommier@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2022/01/05 03:23:29 by apommier #+# #+# */
|
|
/* Updated: 2022/01/05 03:23:29 by apommier ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "push_swap.h"
|
|
|
|
void lst_indexing(t_list *list)
|
|
{
|
|
int index;
|
|
t_list *swap;
|
|
t_list *save;
|
|
|
|
swap = list;
|
|
save = list;
|
|
index = 0;
|
|
while (save)
|
|
{
|
|
index = 1;
|
|
while (swap)
|
|
{
|
|
if (*(int *)save->nbr > *(int *)swap->nbr)
|
|
index++;
|
|
swap = swap->next;
|
|
}
|
|
save->index = index;
|
|
swap = list;
|
|
save = save->next;
|
|
}
|
|
}
|
|
|
|
t_list *is_double_one(t_list *lst)
|
|
{
|
|
t_list *start;
|
|
t_list *swap;
|
|
|
|
start = lst;
|
|
swap = 0;
|
|
while (lst)
|
|
{
|
|
swap = lst->next;
|
|
while (swap)
|
|
{
|
|
if (*(int *)lst->nbr == *(int *)swap->nbr)
|
|
{
|
|
ft_putstr_fd("Error\n", 2);
|
|
ft_lstclear(&start, &free);
|
|
return (0);
|
|
}
|
|
swap = swap->next;
|
|
}
|
|
lst = lst->next;
|
|
}
|
|
return (start);
|
|
}
|
|
|
|
int max_and_sorted(t_list *start)
|
|
{
|
|
long long swap;
|
|
t_list *lst;
|
|
|
|
lst = start;
|
|
swap = 0;
|
|
while (start)
|
|
{
|
|
swap = *(long long *)start->nbr;
|
|
if (swap > 2147483647 || swap < -2147483648)
|
|
{
|
|
ft_putstr_fd("Error\n", 2);
|
|
ft_lstclear(&start, &free);
|
|
return (1);
|
|
}
|
|
start = start->next;
|
|
}
|
|
if (is_sorted(lst))
|
|
{
|
|
ft_lstclear(&lst, &free);
|
|
return (1);
|
|
}
|
|
return (0);
|
|
}
|