public int sqrt(int x) {
int low = 0;
int high = x;
while (low <= high) {
long mid = (low + high) / 2;//防止溢出
if (mid * mid == x)
return (int) mid;
else if (mid * mid < x)
low = (int) (mid + 1);
else
high = (int) (mid - 1);
}
return high;
}
}相关推荐
投递滴滴等公司10个岗位 
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
const flattern = (obj) => {
const res = {};
const dfs = (curr, path) => {
if(typeof curr === 'object' && curr !== null) {
const isArray = Array.isArray(curr);
for(let key in curr) {
const newPath = path ? isArray ? `${path}[${key}]` : `${path}.${key}` : key;
dfs(curr[key], newPath);
}
} else {
res[path] = curr
}
}
dfs(obj);
return res;
}
查看3道真题和解析