From 0f348c6c1d55d2e21d45283e9ebf17f68eee12b4 Mon Sep 17 00:00:00 2001 From: huihut Date: Wed, 26 Dec 2018 01:23:18 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E5=A4=96=E9=93=BE?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Problems/NeumannNeighborProblem/Formula/README.md | 2 +- Problems/NeumannNeighborProblem/Recursive/README.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/Problems/NeumannNeighborProblem/Formula/README.md b/Problems/NeumannNeighborProblem/Formula/README.md index 7ac5490..2882f81 100644 --- a/Problems/NeumannNeighborProblem/Formula/README.md +++ b/Problems/NeumannNeighborProblem/Formula/README.md @@ -9,7 +9,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) ### 功能说明 diff --git a/Problems/NeumannNeighborProblem/Recursive/README.md b/Problems/NeumannNeighborProblem/Recursive/README.md index 7d21fec..0258e2d 100644 --- a/Problems/NeumannNeighborProblem/Recursive/README.md +++ b/Problems/NeumannNeighborProblem/Recursive/README.md @@ -9,7 +9,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) ### 功能说明