Push_swap/creat_stack.c at main · Ismailelazzouzi/Push_swap · GitHub

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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   creat_stack.c                                      :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: isel-azz <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/05/11 07:45:12 by isel-azz          #+#    #+#             */
/*   Updated: 2024/05/11 07:45:17 by isel-azz         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

void	create_stack(char **numbers, t_stack_needs **stack_a)
{
	int	i;
	int	nbr;

	i = 0;
	nbr = 0;
	while (numbers[i] != NULL)
	{
		nbr = ft_atoi(numbers[i], numbers);
		add_node(stack_a, nbr);
		i++;
	}
	if (*stack_a != NULL)
		free_numbers(numbers, 0);
}

void	add_node(t_stack_needs **stack, int nbr)
{
	t_stack_needs	*node_to_add;
	t_stack_needs	*last_node;

	if (stack == NULL)
		return ;
	node_to_add = malloc(sizeof(t_stack_needs));
	if (node_to_add == NULL)
		return ;
	node_to_add->next = NULL;
	node_to_add->value = nbr;
	if (*stack == NULL)
	{
		*stack = node_to_add;
		node_to_add->prev = NULL;
	}
	else
	{
		last_node = get_last_node(*stack);
		last_node->next = node_to_add;
		node_to_add->prev = last_node;
	}
}

t_stack_needs	*get_last_node(t_stack_needs *stack)
{
	if (stack == NULL)
		return (NULL);
	while (stack->next)
		stack = stack->next;
	return (stack);
}