-
Notifications
You must be signed in to change notification settings - Fork 0
/
five_numbers.c
89 lines (82 loc) · 2.4 KB
/
five_numbers.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* five_numbers.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: fulloa-s <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/05/18 15:04:38 by gneri #+# #+# */
/* Updated: 2021/05/20 08:40:31 by fulloa-s ### ########.fr */
/* */
/* ************************************************************************** */
#include "checker.h"
void ft_five_numbers(t_stack *stacks)
{
t_num *head_a;
t_num *head_b;
int i;
i = 0;
while (i++ < 2)
ft_pbmove(stacks);
if (ft_lstsize(stacks->stack_a) == 3)
ft_three_numbers(stacks);
else if (!ft_sorted(stacks->stack_a) && (ft_lstsize(stacks->stack_a) == 2))
ft_samove(stacks);
while (i-- > 1)
{
head_a = stacks->stack_a;
head_b = stacks->stack_b;
if (head_b->number < head_a->number)
ft_pamove(stacks);
else if (head_b->number > ft_lstnode(head_a)->number)
{
ft_pamove(stacks);
ft_ramove(stacks);
}
else
ft_five_numbers2(stacks, head_a, head_b);
}
}
void ft_five_numbers2(t_stack *stacks, t_num *head_a, t_num *head_b)
{
int m;
m = 1;
while (head_a->next)
{
if (head_b->number > head_a->number
&& head_b->number < head_a->next->number && m == 1)
{
ft_pamove(stacks);
ft_samove(stacks);
}
else if (head_b->number > head_a->number
&& head_b->number < head_a->next->number
&& ((m == 2 && (ft_lstsize(stacks->stack_a) == 3))
|| m == 3))
{
ft_rramove(stacks);
ft_pamove(stacks);
ft_ramove(stacks);
ft_ramove(stacks);
}
ft_five_numbers3(stacks, head_a, head_b, m);
m++;
head_a = head_a->next;
}
}
void ft_five_numbers3(t_stack *stacks, t_num *head_a, t_num *head_b, int m)
{
if (head_b->number > head_a->number
&& head_b->number < head_a->next->number
&& m == 2 && (ft_lstsize(stacks->stack_a) == 4))
{
ft_ramove(stacks);
ft_pamove(stacks);
ft_samove(stacks);
ft_rramove(stacks);
}
}
void ft_putchar(char c)
{
write(1, &c, 1);
}