题目
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位int的范围
思路
本来想是用1+2+3+4+…+i的和小于等于n,然后1+2+3+4+…+i+i+1大于n。那么此时就可以返回i了,就是到第i层。
但是最后超时了
public class Solution {
public int arrangeCoins(int n) {
if(n==0) return 0;
for(int i=1;i<=n/2+1;i++){
if((i*(i+1)/2<=n)&&((i+2)*(i+1)/2>n))
{return i;
}
}
return 1;
}
}
换了个思路,使用数学的方程来解出i,就是要返回的数值。利用数学方程i*(i+1)/2=n解出i=Math.sqrt((long)2*n+0.25)-0.5;这是返回的是double类型,然后返回时注意做强制转换为整数。
public class Solution {
public int arrangeCoins(int n) {
if(n==0) return 0;
//注意2*n可能会造成溢出,所以在这里做了转换(long)2*n
double a=Math.sqrt((long)2*n+0.25)-0.5;
return (int)a;
}
}
原题链接
领悟:
1. 注意2*n可能会造成溢出,所以在这里做了转换(long)2*n
2. 注意将类型转化对,比如该题中函数Math.sqrt返回值是double类型,最后要转换为int类型