algorithm/interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2026-03-13 10:02:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加查找算法和SingleProblem

Browse Source
This commit is contained in:
huihut
2018-02-11 01:08:43 +08:00
parent 4667db6985
commit 8a3d4f0e08
29 changed files with 1212 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
Problems/NeumannNeighborProblem/README.md Normal file
View File

@@ -0,0 +1,13 @@
## 冯诺依曼邻居问题
### 问题说明
某算法从一个1×1的方格开始，每次都会在上次图形的周围再加上一圈方格，在第n次的时候要生成多少个方格？下图给出了n = 0，1，2是的结果。
![](http://ojlsgreog.bkt.clouddn.com/NeumannNeighborProblem.jpg)
### 解法
* [通项公式解法](Formula)
* [递推关系解法](Recursive)