# LeetCode-Arranging_Coins

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.

Given n, find the total number of full staircase rows that can be formed.

n is a non-negative integer and fits within the range of a 32-bit signed integer.

Example 1:

n = 5

The coins can form the following rows:
¤
¤ ¤
¤ ¤

Because the 3rd row is incomplete, we return 2.


Example 2:

n = 8

The coins can form the following rows:
¤
¤ ¤
¤ ¤ ¤
¤ ¤

Because the 4th row is incomplete, we return 3.

n 是一个非负整数，并且符合32位有符号整数的范围。

n = 5

¤
¤ ¤
¤ ¤

n = 8

¤
¤ ¤
¤ ¤ ¤
¤ ¤

C++代码（Visual Studio 2017）：

#include "stdafx.h"
#include <iostream>
using namespace std;

class Solution {
public:
int arrangeCoins(int n) {
int i = 1;
while (n >= i) {
n = n - i;
i++;
}
return i-1;
}
};

int main()
{
Solution s;
int n = 6;
int result;
result = s.arrangeCoins(n);
cout << result;
return 0;
}