blob: 6cb06e00183d64dd168989799a0fa2f779635129 (
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
|
/*
ft_printf
Copyright (C) 2026 yctct
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "ft_printf.h"
int ft_putnbr(int n)
{
int counter;
counter = 0;
if (n == -2147483648)
counter += ft_putstr("-2147483648");
else if (n < 0)
{
counter += ft_putchar('-');
n = -n;
counter += ft_putnbr(n);
}
else if (n == 0)
counter += ft_putchar('0');
else if (n > 9)
{
counter += ft_putnbr(n / 10);
counter += ft_putchar((n % 10) + 48);
}
else
counter += ft_putchar(n + 48);
return (counter);
}
/*
// non-recursive implementation
int ft_putnbr(int nb)
{
char c[11];
int i;
long int nbl;
int counter;
nbl = nb;
counter = 0;
if (nbl < 0)
{
nbl *= -1;
counter += write(1, "-", 1);
}
if (nbl == 0)
counter += write(1, "0", 1);
i = 0;
while (nbl)
{
c[i] = (nbl % 10) + 48;
nbl = nbl / 10;
i++;
}
while (i > 0)
{
i--;
counter += write(1, &c[i], 1);
}
c[i] = '\0';
return (counter);
}
*/
|
