leetcode 441. 排列硬币 二分,等差数列

441. 排列硬币

你总共有 n 枚硬币，你需要将它们摆成一个阶梯形状，第 k 行就必须正好有 k 枚硬币。

给定一个数字 n，找出可形成完整阶梯行的总行数。

n 是一个非负整数，并且在32位有符号整型的范围内。

示例 1:

n = 5

硬币可排列成以下几行:
¤
¤ ¤
¤ ¤

因为第三行不完整，所以返回2.

示例 2:

n = 8

硬币可排列成以下几行:
¤
¤ ¤
¤ ¤ ¤
¤ ¤

因为第四行不完整，所以返回3.

答案具有单调性,每次猜前mid项和是否小于等于n

#ifdef debug
#include <time.h>
#include "/home/majiao/mb.h"
#endif

#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define MAXN ((int)1e5+7)
#define ll long long int
#define QAQ (0)

using namespace std;

#define num(x) (x-'0')

#define show(x...)                             \
    do {                                       \
        cout << "\033[31;1m " << #x << " -> "; \
        err(x);                                \
    } while (0)

void err() { cout << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }

bool check(ll mid, ll hav) {
	ll Sn = mid + (mid*((mid-1))/2);
	return Sn <= hav;
}

class Solution {
public:
    int arrangeCoins(int n) {
		ll lef = 0, rig = n, mid, ans = -1;
		while(lef <= rig) {
			mid = (lef + rig) >> 1;
			bool ret = check(mid, n);
			if(ret) {
				ans = mid;
				lef = mid + 1;
			} else
				rig = mid - 1;
		}
		return ans;
    }
};

#ifdef debug
signed main() {
	freopen("test", "r", stdin);
	clock_t stime = clock();
	ll p = 0;
	ll x = (1 << 31);
	p = 1ll*1 + (x*(x-1))/2;
	Solution s;
	cout << s.arrangeCoins(8);






	clock_t etime = clock();
	printf("rum time: %lf 秒\n",(double) (etime-stime)/CLOCKS_PER_SEC);
	return 0;
}
#endif