blob: 078ab7fadd64fec97baf9a951702983ab9818c6d (
plain)
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
90
91
92
93
94
95
96
97
98
99
100
101
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* input_handling.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: dkaiser <dkaiser@student.42heilbronn.de +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/04/12 17:31:49 by dkaiser #+# #+# */
/* Updated: 2024/04/15 16:24:51 by dkaiser ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft/libft.h"
#include "push_swap.h"
static int is_nbr(char *str)
{
if (*str == '-')
str++;
while (*str)
{
if (ft_isdigit(*str))
str++;
else
return (0);
}
return (1);
}
static int is_input_only_nbrs(int argc, char *argv[])
{
while (argc-- > 1)
{
if (!is_nbr(argv[argc]))
return (0);
}
return (1);
}
static int are_numbers_unique(int *stack, int size)
{
int i;
int k;
i = 0;
while (i < size - 1)
{
k = i + 1;
while (k < size)
{
if (stack[i] == stack[k])
return (0);
k++;
}
i++;
}
return (1);
}
static int *get_array_from_input(int argc, char *argv[])
{
int *stack;
int i;
stack = malloc(sizeof(int) * (argc - 1));
if (!stack)
return NULL;
i = 0;
while (i < argc - 1)
{
stack[i] = ft_atoi(argv[i + 1]);
i++;
}
return (stack);
}
t_stack *create_stack(int argc, char *argv[])
{
t_stack *result;
result = malloc(sizeof(t_stack));
if (!result)
return NULL;
if (!is_input_only_nbrs(argc, argv))
return (free(result), NULL);
result->stack = get_array_from_input(argc, argv);
if (!result->stack)
return (free(result), NULL);
if (!are_numbers_unique(result->stack, argc - 1))
{
free(result->stack);
free(result);
return (NULL);
}
result->size = argc - 1;
return (result);
}
|
