diff --git a/notes/Leetcode 题解.md b/notes/Leetcode 题解.md
index 088eb1bd..180f4573 100644
--- a/notes/Leetcode 题解.md	
+++ b/notes/Leetcode 题解.md	
@@ -12,7 +12,6 @@
         * [DFS](#dfs)
         * [Backtracking](#backtracking)
     * [·ÖÖÎ](#·ÖÖÎ)
-    * [µÝ¹é](#µÝ¹é)
     * [¶¯Ì¬¹æ»®](#¶¯Ì¬¹æ»®)
         * [·Ö¸îÕûÊý](#·Ö¸îÕûÊý)
         * [¾ØÕ󷾶](#¾ØÕ󷾶)
@@ -1639,13 +1638,9 @@ public List<Integer> diffWaysToCompute(String input) {
 }
 ```
 
-## µÝ¹é
-
-½«Ô­Ê¼ÎÊÌâ·Ö½â³É½ÏСµÄÎÊÌâÀ´Çó½â¡£
-
 ## ¶¯Ì¬¹æ»®
 
-½«Ô­ÎÊÌâ²ð½â³É¶à¸ö×ÓÎÊÌ⣬ÔÚÇó½â×ÓÎÊÌâµÄʱºò±£´æ×ÓÎÊÌâµÄ½â£¬Ê¹µÃ×ÓÎÊÌâÖ»Çó½âÒ»´Î¡£
+µÝ¹éºÍ¶¯Ì¬¹æ»®¶¼Êǽ«Ô­ÎÊÌâ²ð³É¶à¸ö×ÓÎÊÌâÈ»ºóÇó½â£¬ËûÃÇÖ®¼ä×î±¾ÖʵÄÇø±ðÊÇ£¬¶¯Ì¬¹æ»®±£´æÁË×ÓÎÊÌâµÄ½â¡£
 
 ### ·Ö¸îÕûÊý
 
@@ -1765,8 +1760,6 @@ public int minPathSum(int[][] grid) {
 
 ### ì³²¨ÄÇÆõÊýÁÐ
 
-³ÌÐòÔ±´úÂëÃæÊÔÖ¸ÄÏµÚ 4 Õµķ½·¨½«Çóì³²¨ÄÇÆõµÚ N ÏîÎÊÌâת»»Îª¾ØÕó³Ë·¨ÔËË㣬´Ó¶ø½«Ê±¼ä¸´ÔÓ¶ÈËõСΪ O(lgN)¡£
-
 **ÅÀÂ¥ÌÝ**
 
 [Leetcode : 70. Climbing Stairs (Easy)](https://leetcode.com/problems/climbing-stairs/description/)
@@ -1775,7 +1768,7 @@ public int minPathSum(int[][] grid) {
 
 ¶¨ÒåÒ»¸öÊý×é dp ´æ´¢ÉÏÂ¥Ìݵķ½·¨Êý£¨ÎªÁË·½±ãÌÖÂÛ£¬Êý×éϱê´Ó 1 ¿ªÊ¼£©£¬dp[i] ±íʾ×ßµ½µÚ i ¸öÂ¥Ìݵķ½·¨ÊýÄ¿¡£µÚ i ¸öÂ¥ÌÝ¿ÉÒÔ´ÓµÚ i-1 ºÍ i-2 ¸öÂ¥ÌÝÔÙ×ßÒ»²½µ½´ï£¬×ßµ½µÚ i ¸öÂ¥Ìݵķ½·¨ÊýΪ×ßµ½µÚ i-1 ºÍµÚ i-2 ¸öÂ¥Ìݵķ½·¨ÊýÖ®ºÍ¡£
 
-<center>dp[i] = dp[i-1] + dp[i-2]</center>
+**dp[i] = dp[i-1] + dp[i-2]**
 
 dp[N] ¼´ÎªËùÇó¡£
 
@@ -1804,7 +1797,7 @@ public int climbStairs(int n) {
 
 µÚ i Äê³ÉÊìµÄÅ£µÄÊýÁ¿Îª£º
 
-<center>dp[i] = dp[i-1] + dp[i-3]</center>
+**dp[i] = dp[i-1] + dp[i-3]**
 
 **Ç¿µÁÇÀ½Ù**
 
@@ -1814,7 +1807,7 @@ public int climbStairs(int n) {
 
 ¶¨Òå dp Êý×éÓÃÀ´´æ´¢×î´óµÄÇÀ½ÙÁ¿£¬ÆäÖÐ dp[i] ±íʾÇÀµ½µÚ i ¸öס»§Ê±µÄ×î´óÇÀ½ÙÁ¿¡£ÓÉÓÚ²»ÄÜÇÀ½ÙÁÚ½üס»§£¬Òò´ËÈç¹ûÇÀ½ÙÁËµÚ i ¸öס»§ÄÇôֻÄÜÇÀ½Ù i - 2 ºÍ i - 3 µÄס»§£¬ËùÒÔ
 
-![](http://latex.codecogs.com/gif.latex?\\\\dp[i]=max(dp[i-2],dp[i-3])+nums[i])
+**dp[i] = max(dp[i - 2], dp[i - 3]) + nums[i]**
 
 O(n) ¿Õ¼ä¸´ÔÓ¶ÈʵÏÖ·½·¨£º
 
@@ -1894,7 +1887,7 @@ private int rob(int[] nums, int s, int e) {
 
 ×ÛÉÏËùÊö£¬´íÎó×°ÐÅÊýÁ¿·½Ê½ÊýÁ¿Îª£º
 
-<center> dp[i] = (i-1) \* dp[i-2] + (i-1) \* dp[i-1] </center>
+![](http://latex.codecogs.com/gif.latex?\\\\dp[i]=(i-1)*dp[i-2]+(i-1)*dp[i-1])
 
 dp[N] ¼´ÎªËùÇó¡£