[Leetcode] 441. 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.

思路：

练手题目^_^。贴三段不同思路的实现。

代码：

class Solution {
public:
    int arrangeCoins(int n) {
        long long m = n;
        m *= 2;
        long long left = 0, right = sqrt(m);
        while (left <= right) {
            long long mid = left + (right - left) / 2;
            if (mid * (mid + 1) <= m) {
                left = mid + 1;
            }
            else {
                right = mid - 1;
            }
        }
        return right;
    }
};

class Solution {
public:
    int arrangeCoins(int n) {
        long long k = 0;
        long long m = n;
        while (k * (k + 1) <= 2 * m) {
            ++k;
        }
        return static_cast<int>(k - 1);
    }
};

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