समस्या
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!.
सीमाएँ
0 ≤ n ≤ 20, so the result fits a signed 64-bit integer.
उदाहरण
इनपुट:
n = 5
अपेक्षित आउटपुट:
expected = 120
इनपुट:
long long n = 5;
अपेक्षित आउटपुट:
long long expected = 120;
इनपुट:
long n = 5;
अपेक्षित आउटपुट:
long expected = 120;
व्याख्या
1 × 2 × 3 × 4 × 5 = 120.
इनपुट:
n = 0
अपेक्षित आउटपुट:
expected = 1
इनपुट:
long long n = 0;
अपेक्षित आउटपुट:
long long expected = 1;
इनपुट:
long n = 0;
अपेक्षित आउटपुट:
long expected = 1;
व्याख्या
0! is defined as 1.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Factorial multiplies all integers from 1 up to the given number.
संकेत 2
An iterative running product is enough, and 0 has a special defined result.
संकेत 3
Because the input is small, overflow is the main detail to watch for in other languages.
अपेक्षित जटिलता
O(n) time, O(1) extra space