Merge branch 'master' of https://github.com/kenwoodjw/python_interview_question

Author: kenwoodjw

README.md

@@ -2482,17 +2482,17 @@ def fibs():
 
 
 def fibonacci(n):
-    fibs = fibs()
+    fibs_ = fibs()
     for _ in range(n):
-        next(fibs)
+        next(fibs_)
     return next(fibs)
 ```
 
 #### Logarithmic
 
 **矩阵**
 
-```
+```python
 import numpy as np
 def fibonacci(n):
     return (np.matrix([[0, 1], [1, 1]]) ** n)[1, 1]
@@ -2598,4 +2598,4 @@ class Solution:
 
 ### [Python后端架构演进](<https://zhu327.github.io/2018/07/19/python%E5%90%8E%E7%AB%AF%E6%9E%B6%E6%9E%84%E6%BC%94%E8%BF%9B/>)
 
-这篇文章几乎涵盖了python会用的架构，在面试可以手画架构图，根据自己的项目谈下技术选型和优劣，遇到的坑等。绝对加分
+这篇文章几乎涵盖了python会用的架构，在面试可以手画架构图，根据自己的项目谈下技术选型和优劣，遇到的坑等。绝对加分