Problema
The factorial of n, written n!, is 1 × 2 × … × n. By definition 0! = 1.
Implement factorial(n).
Input
n: A non-negative integer.
Output
Return n!.
Restricciones
0 ≤ n ≤ 20, so the result fits a signed 64-bit integer.
Ejemplos
Entrada:
n = 5
Salida esperada:
expected = 120
Entrada:
long long n = 5;
Salida esperada:
long long expected = 120;
Entrada:
long n = 5;
Salida esperada:
long expected = 120;
Explicación
1 × 2 × 3 × 4 × 5 = 120.
Entrada:
n = 0
Salida esperada:
expected = 1
Entrada:
long long n = 0;
Salida esperada:
long long expected = 1;
Entrada:
long n = 0;
Salida esperada:
long expected = 1;
Explicación
0! is defined as 1.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Factorial multiplies all integers from 1 up to the given number.
Pista 2
An iterative running product is enough, and 0 has a special defined result.
Pista 3
Because the input is small, overflow is the main detail to watch for in other languages.
Complejidad esperada
O(n) time, O(1) extra space