-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathft_strsplit.c
89 lines (80 loc) · 2.01 KB
/
ft_strsplit.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strsplit.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: rymuller <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/11/27 15:39:38 by rymuller #+# #+# */
/* Updated: 2018/11/30 21:36:20 by rymuller ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static size_t words_num(const char *s, char c)
{
size_t i;
size_t words_num;
i = 0;
words_num = 0;
while (s[i])
{
if (s[i] != c)
if (s[i + 1] == c || s[i + 1] == '\0')
words_num++;
i++;
}
return (words_num);
}
static size_t word_len(const char *s, char c)
{
size_t i;
if (s != NULL)
{
i = 0;
while (s[i] != c && s[i] != '\0')
i++;
return (i);
}
return (0);
}
static char **ft_words(char const *s, char **words, char c, size_t len)
{
size_t i;
size_t j;
size_t k;
i = 0;
j = 0;
k = 0;
while (i < len)
{
while (s[k] == c)
k++;
if (!(words[i] =
(char *)malloc(sizeof(char) * (word_len(&s[k], c) + 1))))
{
while (i != 0)
free(words[--i]);
free(words);
return (NULL);
}
while (s[k] != c && s[k] != '\0')
words[i][j++] = s[k++];
words[i++][j] = '\0';
j = 0;
}
return (words);
}
char **ft_strsplit(char const *s, char c)
{
size_t len;
char **words;
if (s != NULL)
{
len = words_num(s, c);
if (!(words = (char **)malloc(sizeof(char *) * (len + 1))))
return (NULL);
words[len] = NULL;
return (ft_words(s, words, c, len));
}
return (NULL);
}