基础算法
二分
l = -1, r = N;
while (l + 1 != r)
{
m = (l + r) / 2;
if IsBlue (m)
l = m;
else
r = m;
}
return l or r;
快速幂
r = 1;
while (n != 0)
if (n & 1 == 1) //n % 2 == 1
r = r * a;
a = a * a;
n = n >> 1 ; //n = n / 2
return r;
快手成长空间 763人发布