blob: ea97bb65d707f6d19d71238a36153da87e01547f (
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
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strjoin.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <charles.cabergs@gmail.com> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/07/07 16:14:25 by cacharle #+# #+# */
/* Updated: 2019/07/09 09:08:52 by cacharle ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdlib.h>
int my_strlen(char *str)
{
int i;
i = 0;
while (str[i])
i++;
return (i);
}
int cummulative_strlen(int size, char **strs)
{
int i;
int len;
len = 0;
i = 0;
while (size > 0)
{
len += my_strlen(strs[size - 1]);
size--;
}
return (len);
}
char *ft_strjoin(int size, char **strs, char *sep)
{
int i;
int j;
int k;
int l;
char *join;
join = (char*)malloc(sizeof(char) * (cummulative_strlen(size, strs)
+ my_strlen(sep) * (size - 1) + 1));
j = 0;
l = 0;
while (l < size)
{
i = 0;
while (strs[l][i])
{
join[j] = strs[l][i];
i++;
j++;
}
k = 0;
while (l != size - 1 && sep[k])
join[j++] = sep[k++];
l++;
}
return (join);
}
|
