原题:
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个棋子,让你按1,2,3,...的顺序放置直到放完,最后一行可以不完整,然后返回行数(不完整的最后一行不计入)。画图可以发现,无论什么情况,完整的部分*2总能拼成m*(m+1)形式的矩形,m就是所求行数,比如7个棋子:
o | x | x | x |
o | o | x | x |
o | o | o | x |
o | x |
12个棋子:
o | x | x | x | x |
o | o | x | x | x |
o | o | o | x | x |
o | o | o | o | x |
o | o | x | x |
这样只要对2n求根号就行了。不过实际情况还有一点点复杂,就是2n矩形最后一行填满时会多1行,比如8个棋子时会让图1最后一行满但是其实最后一行是不完整的。关于这种情况只要比较一下2n-m*(m+1)/2与宽的大小就行,结果:
Success
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Arranging Coins.
Memory Usage: 8.1 MB, less than 82.06% of C++ online submissions for Arranging Coins.
代码:
class Solution {
public:
int arrangeCoins(int n) {
long square=2*long(n);
long i=sqrt(square);
if((square-i*(i-1))/2<i){i--;}
return i;
}
};