diff --git a/docs/notes/pics/11550465817827.gif b/docs/notes/pics/11550465817827.gif new file mode 100644 index 00000000..5a718e70 Binary files /dev/null and b/docs/notes/pics/11550465817827.gif differ diff --git a/docs/notes/pics/1_2001550465428749.png b/docs/notes/pics/1_2001550465428749.png new file mode 100644 index 00000000..e21e3837 Binary files /dev/null and b/docs/notes/pics/1_2001550465428749.png differ diff --git a/docs/notes/pics/21550465890674.gif b/docs/notes/pics/21550465890674.gif new file mode 100644 index 00000000..2ef91795 Binary files /dev/null and b/docs/notes/pics/21550465890674.gif differ diff --git a/docs/notes/剑指 offer 题解.md b/docs/notes/剑指 offer 题解.md index ab457739..749db028 100644 --- a/docs/notes/剑指 offer 题解.md +++ b/docs/notes/剑指 offer 题解.md @@ -510,6 +510,8 @@ public class Solution { 一只青蛙一次可以跳上 1 级台阶，也可以跳上 2 级。求该青蛙跳上一个 n 级的台阶总共有多少种跳法。 +

+ ## 解题思路 ```java @@ -535,6 +537,8 @@ public int JumpFloor(int n) { 我们可以用 2\*1 的小矩形横着或者竖着去覆盖更大的矩形。请问用 n 个 2\*1 的小矩形无重叠地覆盖一个 2\*n 的大矩形，总共有多少种方法？ +

+ ## 解题思路 ```java @@ -560,6 +564,8 @@ public int RectCover(int n) { 一只青蛙一次可以跳上 1 级台阶，也可以跳上 2 级... 它也可以跳上 n 级。求该青蛙跳上一个 n 级的台阶总共有多少种跳法。 +

+ ## 解题思路 ### 动态规划 diff --git a/docs/pics/11550465817827.gif b/docs/pics/11550465817827.gif new file mode 100644 index 00000000..5a718e70 Binary files /dev/null and b/docs/pics/11550465817827.gif differ diff --git a/docs/pics/1_2001550465428749.png b/docs/pics/1_2001550465428749.png new file mode 100644 index 00000000..e21e3837 Binary files /dev/null and b/docs/pics/1_2001550465428749.png differ diff --git a/docs/pics/21550465890674.gif b/docs/pics/21550465890674.gif new file mode 100644 index 00000000..2ef91795 Binary files /dev/null and b/docs/pics/21550465890674.gif differ