Leetcode 441. Arranging Coins

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Arranging Coins

2. Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
int arrangeCoins(int n) {
int k = 0;
while(n > 0) {
++k;
n -=k;
}
if(n == 0) {
return k;
}
return k - 1;
}
};

Reference

  1. https://leetcode.com/problems/arranging-coins/description/
如果有收获,可以请我喝杯咖啡!