Problema
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.
Vincoli
0 ≤ n ≤ 1,000,000,000. The result fits a signed 64-bit integer.
Esempi
Input:
n = 10
Output atteso:
expected = 55
Input:
long long n = 10;
Output atteso:
long long expected = 55;
Input:
long n = 10;
Output atteso:
long expected = 55;
Spiegazione
1 + 2 + … + 10 = 55.
Input:
n = 0
Output atteso:
expected = 0
Input:
long long n = 0;
Output atteso:
long long expected = 0;
Input:
long n = 0;
Output atteso:
long expected = 0;
Spiegazione
No numbers to add, so the sum is 0.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Look for a pattern in the running totals instead of adding every number one by one.
Suggerimento 2
Use the arithmetic-series shortcut based on the first and last terms, which avoids looping.
Suggerimento 3
Be careful with the 0 case, and ensure your arithmetic stays within 64-bit limits.
Complessità attesa
O(1) time, O(1) extra space