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 个硬币你想让它们形成阶梯的形状,每一第 行必须包含 个硬币。

给定 n,找出可形成的完整楼梯行的总数。

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

例子1:

n = 5

硬币可以形成以下行:
¤
¤ ¤
¤ ¤

因为第 3 行是不完整的,我们返回 2。


例子2:

n = 8

硬币可以形成以下行:
¤
¤ ¤
¤ ¤ ¤
¤ ¤

因为第 4 行是不完整的,我们返回 3。


思路:

思路很简单,不赘述了,直接看代码。


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;
}

阅读更多
换一批

没有更多推荐了,返回首页