-
Notifications
You must be signed in to change notification settings - Fork 0
/
push_swap_utils.c
111 lines (101 loc) · 2.25 KB
/
push_swap_utils.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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* push_swap_utils.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: hbaddrul <hbaddrul@student.42kl.edu.my> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/09/29 14:34:22 by hbaddrul #+# #+# */
/* Updated: 2021/11/24 20:56:50 by hbaddrul ### ########.fr */
/* */
/* ************************************************************************** */
#include <limits.h>
#include <stdlib.h>
#include "libft/libft.h"
static int is_int(char *str)
{
int i;
i = 0;
if (str[i] == '+' || str[i] == '-')
++i;
while (str[i])
if (!ft_isdigit(str[i++]))
return (0);
if (ft_atol(str) < INT_MIN || ft_atol(str) > INT_MAX)
return (0);
return (1);
}
static int has_duplicate(int *nums, int len)
{
int i;
int j;
i = 0;
while (i < len - 1)
{
j = i + 1;
while (j < len)
if (nums[i] == nums[j++])
return (1);
++i;
}
return (0);
}
int split_argv(char ***strs, char **argv, char *sep)
{
int ret;
char *str;
char *tmp;
str = 0;
while (*argv)
{
if (!str)
str = ft_strdup(*argv++);
else
{
tmp = str;
str = ft_strjoin(str, sep);
free(tmp);
tmp = str;
str = ft_strjoin(str, *argv++);
free(tmp);
}
}
*strs = ft_split(str, *sep);
free(str);
ret = 0;
while ((*strs)[ret])
++ret;
return (ret);
}
int is_valid(char **strs)
{
int i;
int tmp;
int ret;
int *nums;
i = 0;
ret = 0;
while (strs[i])
if (!is_int(strs[i++]))
return (ret);
nums = malloc(sizeof(int) * i);
if (!nums)
return (ret);
tmp = i;
while (i--)
nums[i] = ft_atoi(strs[i]);
if (!has_duplicate(nums, tmp))
ret = 1;
free(nums);
return (ret);
}
int is_sorted(t_list *stack)
{
while (stack->next)
{
if (ft_atoi(stack->content) > ft_atoi(stack->next->content))
return (0);
stack = stack->next;
}
return (1);
}