54be2278c0
algorithm with no double nodes and nearly efficient enough still some optimizations to find for --big-superposition maps
31 lines
1.1 KiB
C
31 lines
1.1 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_nbrlen.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/07/25 17:45:29 by tmaze #+# #+# */
|
|
/* Updated: 2018/07/25 18:20:22 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
size_t ft_nbrlen(int nb)
|
|
{
|
|
size_t nb_len;
|
|
|
|
nb_len = 0;
|
|
if (nb <= 0)
|
|
nb_len++;
|
|
if (nb < 0)
|
|
nb *= -1;
|
|
while (nb > 0)
|
|
{
|
|
nb /= 10;
|
|
nb_len++;
|
|
}
|
|
return (nb_len);
|
|
}
|