【leetcode】441. Arranging Coins【E】
来源:互联网 发布:淘宝华佗大药房旗舰店 编辑:程序博客网 时间:2024/06/08 10:54
You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
Given n, find the total number of full staircase rows that can be formed.
n is a non-negative integer and fits within the range of a 32-bit signed integer.
Example 1:
n = 5The coins can form the following rows:¤¤ ¤¤ ¤Because the 3rd row is incomplete, we return 2.
Example 2:
n = 8The coins can form the following rows:¤¤ ¤¤ ¤ ¤¤ ¤Because the 4th row is incomplete, we return 3.
Subscribe to see which companies asked this question
这道题简直不能更简单,可不知道为啥通过率竟然这么低。。
其实就是
1+2+……+k < n, 求最大的k是多少
class Solution(object): def arrangeCoins(self, n): res = 0 while n > res: res += 1 n -= res #print res,n return res
0 0
- 【leetcode】441. Arranging Coins【E】
- LeetCode 441. Arranging Coins
- LeetCode 441. Arranging Coins
- leetcode 441. Arranging Coins
- Leetcode: 441. Arranging Coins
- LeetCode 441. Arranging Coins
- 【LeetCode】 441. Arranging Coins
- LeetCode 441. Arranging Coins
- [leetcode]441. Arranging Coins
- LeetCode 441. Arranging Coins
- Leetcode 441. Arranging Coins
- leetcode-441. Arranging Coins
- [LeetCode]441. Arranging Coins
- LeetCode-441. Arranging Coins
- 【LeetCode】441. Arranging Coins
- [LeetCode]441. Arranging Coins
- 【Leetcode】441. Arranging Coins
- [leetcode]: 441. Arranging Coins
- Open CV学习记录(十三)——HcVision码流
- 第十周项目三-利用二叉树遍历思想解决问题
- 分布式系统的特点及设计理念
- 带你去看——WRC 2016 世界机器人博览会
- UGUI 如何判断鼠标停在UI上
- 【leetcode】441. Arranging Coins【E】
- 右左法则----复杂指针解析
- 多维数组
- 定位:提高生产力的开端
- 如何在caffe中自定义网络层
- 网站XSS漏洞攻击如何修补
- [CF593D]行走
- TCP的三次握手(建立连接)和四次挥手(关闭连接)
- Bash on Windows