A simple math.. take care of data overflow though.
class Solution {
public:
int arrangeCoins(int n) {
if(n < ) return -;
return sqrt((long long) * n + 0.25) - 0.5;
}
};
A simple math.. take care of data overflow though.
class Solution {
public:
int arrangeCoins(int n) {
if(n < ) return -;
return sqrt((long long) * n + 0.25) - 0.5;
}
};