441. Arranging Coins（python+cpp）

题目：

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.

解释：
因为是连续求和，所以想到mid*(mid+1)/2，然后可以通过二分查找的方式找到mid。
python代码：

class Solution(object):
    def arrangeCoins(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n <=0:
            return 0
        if n==1:
            return 1
        left=1
        right=n
        while left<=right:
            mid=(left+right)/2
            temp=(mid*(mid+1))/2
            if temp==n:
                return mid
            elif temp>n:
                right=mid-1
            else:
                left=mid+1
        return left-1        

c++代码：

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

总结：
c++用乘法的时候会超出范围，所以注意要改变数值类型，注意，mid的数据类型一定要改成long，不然答案是错的，可能是因为如果mid是int类型的，那么它相乘的结果默认是用int存储的，即使转化为long类型，如果tmp过大，还是会变成负数，答案错误。