docs: add a description of the solution to lc problem: No.1414 (doocs#701)

* docs: add a description of the solution to lc problem: No.1414

No.1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

* fix: fix pseudocode format

Author: YangFong

solution/1400-1499/1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K/README.md

@@ -53,6 +53,21 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+由于斐波那契数特点，数字重用在此题中是一个烟雾弹。举例推导：`k = 288`，数列（局部）`1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377`，可以由两个 144，或 `233 + 55` 组成；`k = 10`，可以由两个 5 或 `8 + 2` 组成。 
+
+由此可以使用贪心策略，逆向遍历斐波那契数列，进行暴力查找：
+
+```txt
+FIND-MIN-FIBONACCI-NUMBERS(k)
+    r = 0
+    for n in f 
+        if k >= n 
+            k -= n
+            r++
+            if k === 0
+                return res
+```
+
 <!-- tabs:start -->
 
 ### **Python3**