Problème
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.
Contraintes
0 ≤ n ≤ 1,000,000,000. The result fits a signed 64-bit integer.
Exemples
Entrée :
n = 10
Sortie attendue :
expected = 55
Entrée :
long long n = 10;
Sortie attendue :
long long expected = 55;
Entrée :
long n = 10;
Sortie attendue :
long expected = 55;
Explication
1 + 2 + … + 10 = 55.
Entrée :
n = 0
Sortie attendue :
expected = 0
Entrée :
long long n = 0;
Sortie attendue :
long long expected = 0;
Entrée :
long n = 0;
Sortie attendue :
long expected = 0;
Explication
No numbers to add, so the sum is 0.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Look for a pattern in the running totals instead of adding every number one by one.
Indice 2
Use the arithmetic-series shortcut based on the first and last terms, which avoids looping.
Indice 3
Be careful with the 0 case, and ensure your arithmetic stays within 64-bit limits.
Complexité attendue
O(1) time, O(1) extra space