leetcode441

public class Solution {
    public int ArrangeCoins(int n) {
        //convert int to long to prevent integer overflow
            long nLong = (long)n;
            long st = 0;
            long ed = nLong;
            long mid = 0;
            while (st <= ed)
            {
                mid = st + (ed - st) / 2;

                if (mid * (mid + 1) <= 2 * nLong)
                {
                    st = mid + 1;
                }
                else
                {
                    ed = mid - 1;
                }
            }
            return (int)(st - 1);
    }
}

https://leetcode.com/problems/arranging-coins/#/description