441. Arranging Coins
来源:互联网 发布:网络应用层协议有哪些 编辑:程序博客网 时间:2024/06/03 20:35
class Solution(object):
def arrangeCoins(self, n):
"""
:type n: int
:rtype: int
"""
i = 1
while n:
n -= i
i +=1
if n == i:
return i
elif n < i:
return i-1
def arrangeCoins(self, n):
"""
:type n: int
:rtype: int
"""
i = 1
while n:
n -= i
i +=1
if n == i:
return i
elif n < i:
return i-1
return 0
另一种等差数列化简:
http://blog.csdn.net/cloudox_/article/details/53005388
(1+x)*x/2 <= n
x + x*x <= 2*n
4*x*x + 4*x <= 8*n
(2*x + 1)*(2*x + 1) - 1 <= 8*n
x <= (sqrt(8*n + 1) - 1) / 2
阅读全文
0 0
- LeetCode 441. Arranging Coins
- 441. Arranging Coins
- 441. Arranging Coins
- 441. Arranging Coins
- 441. Arranging Coins
- LeetCode 441. Arranging Coins
- 441. Arranging Coins
- 441. Arranging Coins
- leetcode 441. Arranging Coins
- 441. Arranging Coins
- Leetcode: 441. Arranging Coins
- LeetCode 441. Arranging Coins
- 441. Arranging Coins
- 【LeetCode】 441. Arranging Coins
- LeetCode 441. Arranging Coins
- [leetcode]441. Arranging Coins
- 441. Arranging Coins
- 441. Arranging Coins*
- 单例模式
- springAOP 实现事务的管理
- Intellij 快捷键
- 求int型正整数在内存中存储时1的个数
- CreateDirectory()用法
- 441. Arranging Coins
- 【死磕Java并发】-----J.U.C之Java并发容器:ConcurrentHashMap
- Prim最小生成树算法
- Java-06-程序逻辑控制
- mybatis中#和$符号的区别
- TUM数据集测评工具的使用
- eclipse 创建maven web项目
- PAT(B)_1037. 在霍格沃茨找零钱(20)
- laravel(六)-Blade模板