摘要:
背景 在windows下新建的sh文件,copy到linux下有的会报错,一般是格式问题默认情况下windows格式会在段落末尾有CR、LF,但是Unix格式只有LF 示例 执行sh脚本文件 ./file.sh -bash: ./file.sh: /bin/sh^M: 坏的解释器: 没有那个文件或目 阅读全文
摘要:
起因 最近做了需要做几个基础镜像,Dockerfile 来自 Github 某仓库,镜像使用的是 Alpine Linux 3.18,且这个镜像已经更改过软件包管理器 apk 所使用的软件包仓库(记住这句话),后面基于这个镜像我还需要额外加了一些其他软件包,Dockerfile 大致如下 FROM 阅读全文
摘要:
Source Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. The lowest common ancestor is the node wi 阅读全文
摘要:
方案一 隐藏某个请求头后再加上。检查特定的 HTTP 响应是否在 Nginx 的 location 块中包含 "Access-Control-Allow-Origin" 头部,可以使用 proxy_hide_header 指令来隐藏响应中的头部,若隐藏后再加上可以实现去重的效果。 以下是实现此操作的 阅读全文
摘要:
Source Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example Given the below binary tree, 1 / \ 阅读全文
摘要:
Source Problem Statement Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a bina 阅读全文
摘要:
Source Problem Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the rootnode down to 阅读全文
摘要:
Source Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root 阅读全文
摘要:
Source Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). Example Given binary tree 阅读全文
摘要:
Source Given a binary tree, return the postorder traversal of its nodes' values. Example Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. Challe 阅读全文