首页 > 代码库 > leetcode441
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
leetcode441
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。