समस्या
The n-th triangular number is 1 + 2 + … + n. A formula avoids looping over huge inputs. The 0th triangular number is 0.
Implement triangular_number(n).
Input
n: A non-negative integer.
Output
Return 1 + 2 + … + n.
सीमाएँ
0 ≤ n ≤ 1,000,000,000. The result fits a signed 64-bit integer.
उदाहरण
इनपुट:
n = 10
अपेक्षित आउटपुट:
expected = 55
इनपुट:
long long n = 10;
अपेक्षित आउटपुट:
long long expected = 55;
इनपुट:
long n = 10;
अपेक्षित आउटपुट:
long expected = 55;
व्याख्या
1 + 2 + … + 10 = 55.
इनपुट:
n = 0
अपेक्षित आउटपुट:
expected = 0
इनपुट:
long long n = 0;
अपेक्षित आउटपुट:
long long expected = 0;
इनपुट:
long n = 0;
अपेक्षित आउटपुट:
long expected = 0;
व्याख्या
No numbers to add, so the sum is 0.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Look for a pattern in the running totals instead of adding every number one by one.
संकेत 2
Use the arithmetic-series shortcut based on the first and last terms, which avoids looping.
संकेत 3
Be careful with the 0 case, and ensure your arithmetic stays within 64-bit limits.
अपेक्षित जटिलता
O(1) time, O(1) extra space