https://leetcode-cn.com/problems/arranging-coins/
class Solution {
public:
int arrangeCoins(int n)
{
int cnt=0,i=1;
while(n>=i) cnt++,n-=i,i++;
return cnt;
}
};
https://leetcode-cn.com/problems/arranging-coins/
class Solution {
public:
int arrangeCoins(int n)
{
int cnt=0,i=1;
while(n>=i) cnt++,n-=i,i++;
return cnt;
}
};
名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
