From bab1292367b68ece46bb54ef8342b327fe891be3 Mon Sep 17 00:00:00 2001
From: huihut <huihut@outlook.com>
Date: Wed, 26 Dec 2018 00:46:54 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E5=86=AF=E8=AF=BA=E4=BE=9D?=
 =?UTF-8?q?=E6=9B=BC=E9=82=BB=E5=B1=85=E9=97=AE=E9=A2=98=E5=A4=96=E9=93=BE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 Problems/NeumannNeighborProblem/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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)
 
 ### 解法