diff --git a/Problems/NeumannNeighborProblem/README.md b/Problems/NeumannNeighborProblem/README.md index c2e76a43..a124ba8a 100644 --- a/Problems/NeumannNeighborProblem/README.md +++ b/Problems/NeumannNeighborProblem/README.md @@ -5,7 +5,7 @@ 某算法从一个1×1的方格开始,每次都会在上次图形的周围再加上一圈方格,在第n次的时候要生成多少个方格?下图给出了n = 0,1,2是的结果。 -![](http://ojlsgreog.bkt.clouddn.com/NeumannNeighborProblem.jpg) +![](https://huihut-img.oss-cn-shenzhen.aliyuncs.com/NeumannNeighborProblem.jpg) ### 解法