Mirrors/interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2025-12-18 04:54:39 +03:00
Code Issues Actions Packages Projects Releases Wiki Activity

更新外链

Browse Source
This commit is contained in:
huihut
2018-12-26 01:23:18 +08:00
parent bab1292367
commit 0f348c6c1d
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Problems/NeumannNeighborProblem/Formula/README.md
View File

@@ -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)
### 功能说明

2
Problems/NeumannNeighborProblem/Recursive/README.md
View File

@@ -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)
### 功能说明