面试代码题总结

21/07/31
https://github.com/afatcoder/LeetcodeTop/blob/master/bytedance/backend.md 到第22. 括号生成

21/07 以前

  1. 动态规划,注意空间状态的优化
  2. 转化为图,求图的最短路径
  3. 从终点往起点递推
void random_float(){
    double left=0.0, right=1.0;
    double eps=1e-8;
    while(right-left>=eps){
        int res=random3();
        if(res == 0){
            right =left+(right-left)/3;
        }
        else if(res == 1){
            double tmp=left;
            left=tmp+(right-tmp)/3;
            right=tmp+(right-tmp)*2/3;
        }
        else{
            left= left+(right-left)*2/3;
        }
    }
    return left;
}
posted @ 2020-12-03 19:10  xzhws  阅读(239)  评论(0编辑  收藏  举报