- 博客(4)
- 收藏
- 关注
RSS订阅原创 [Leetcode] Breadth-first Search
[Leetcode] Breadth-first SearchDescriptionAnalysisIt is easy to understand the question. To be simple, we just need to reach the position in the graph in a specific order and calculate the minimal nece
2017-11-23 13:10:00
308
原创 [Leetcode]Dynamic Programming
Dynamic Programming174. Dungeon GameDungeon GameAt first, I wanna use DFS to search all of the possible states, but I finally find that it will takes too much time. It is likely that there are some met
2017-11-16 11:03:51
277
原创 [Leetcode]Dynamic Programming
Dynamic ProgrammingIn this blog, I will solve two problem in leetcode to introduce an important idea in dynamic programming. As we all know, dynamic programming is one of the hardest algorithms to unde
2017-11-11 12:29:31
310
原创 [Leetcode] Math & Dynamic
[Leetcode] Math & DynamicIn this blog, I try to explain how to solve two similar question about Math & Dynamic. The idea in these two question is pretty similar, if you have mastered how to solve one o
2017-11-04 10:17:01
317
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人