分治和回溯
8 Jul 2020
解决算法问题的乐趣
以LeetCode平台为例
问题聚焦，需求明确
测试完备，性能敏感
学生时代的际遇：汉诺塔问题
初中时代，同学游戏机里初遇：
求对于n个盘子，移动到最终位置需要的最少步数
Enter fullscreen
Go to previous slide
Go to next slide
Show slide overview
Toggle camera view
Record video
Select recording device
Show drawing toolbar
Presenter Mode
Adjust settings
45
/ 76
Draw with stylus
Draw a line
Draw an arrow
Draw an ellipse
Draw a rectangle
Erase
Adjust stroke width
Set brush color
Set brush color
Set brush color
Set brush color
Set brush color
Set brush color
Set brush color
Undo
Redo
Delete
Pin drawing
