思路:
判断当前行row的剩余总数是否大于row,若是则row++,更新剩余总数为n-row,继续处理下一行。
public class Solution {
public int arrangeCoins(int n) {
int row = 0, count = 1;
while (n > row) {
row++;
n -= row;
}
return row;
}
}
Runtime:55ms