class Solution {
public:
int arrangeCoins(int n) {
long long i=0; //防止溢出
int row=0,cnt=0;
while(i<=n){
row++;
i+=row;
if(i<=n) cnt++;
}
return cnt;
}
};
LeetCode-441. 排列硬币-easy
最新推荐文章于 2024-09-07 16:56:49 发布