441. Arranging Coins

2017-08-29 • JAVA Brush Log (2017) • 3123 次阅读 • No one has discussed it yet • 129Like

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) {
        int i=1;
        while(n>=0){
            n -= i;
            i++;
        }
        return i-2;
    }
}

This site Original article All followed" Attribution—NonCommercial—ShareAlike 4.0 (CC BY-NC-SA 4.0) ”。 Please keep the following marks for sharing and interpretation:

Original author: Jake Tao Source: 「441. Arranging Coins」

leetcode

Praise 129

0 0 129

About the Author

Jake Tao

642 Article

332 Comment

Jake is from Hangzhou. He has studied and worked in the United States for decades, and has worked in many technology companies, financial institutions and entrepreneurial teams. He has founded projects such as Pingjing Network, HelloGWU, North American Student Network, Neighborhood, and Foreign Land. With international team management experience and senior technical research and development background, he is keen on creating and practicing from zero to one. If you resonate, welcome to communicate!