leetcode 441. Arranging Coins
解方程:
int arrangeCoins(int n) { long sum = (long)n; return sqrt(sum * 2 + 0.25) - 0.5; }
【本文章出自博客园willaty,转载请注明作者出处,误差欢迎指出~】
解方程:
int arrangeCoins(int n) { long sum = (long)n; return sqrt(sum * 2 + 0.25) - 0.5; }