Update 045._Jump_Game_II.md

045._Jump_Game_II.md

@@ -11,11 +11,11 @@ Easy
 
 思路
 
-# greedy solution, the current jump is ```[i, cur_end]```, and the ```cur_farthest``` is the farthest point 
-# that all of point in ```[i, cur_end]``` can reach, whenever ```cur_farthest``` is larger than the last point' index, 
-# return current ```jump+1```; whenever ```i``` reaches ```cur_end```, update ```cur_end``` to ```current cur_farthest```.
-# Time: O(log(n))
-# Space: O(1)
+greedy solution, the current jump is ```[i, cur_end]```, and the ```cur_farthest``` is the farthest point 
+that all of point in ```[i, cur_end]``` can reach, whenever ```cur_farthest``` is larger than the last point' index, 
+return current ```jump+1```; whenever ```i``` reaches ```cur_end```, update ```cur_end``` to ```current cur_farthest```.
+- Time: O(log(n))
+- Space: O(1)
 
 ```python
 class Solution(object):