0

求解最长增加子数列

Posted by nanxiao on 十一月 17, 2016 in 技术 |

求最长增加子数列是一道经典算法题,其动态规划解法最简单,但是时间复杂度是O(n²)。stackoverflow […]

标签:,

0

递归VS非递归

Posted by nanxiao on 十一月 10, 2016 in 技术 |

递归是一种很常见的解决问题办法,比如求解Fibonacci数列: int Fibonacci(int n) { […]

标签:

0

分析求子数组最大值问题

Posted by nanxiao on 十一月 7, 2016 in 技术 |

求子数组的最大值是一道经典dynamic programming题,解法如下(参考这里): public in […]

标签:,

0

由一道题理解DFS算法

Posted by nanxiao on 十一月 3, 2016 in 技术 |

GENERATE PARENTHESES这篇文章讲解了如何使用Depth First Search,即DFS算 […]

标签:,

0

Memoization和dynamic programming

Posted by nanxiao on 十月 19, 2016 in 技术 |

这篇笔记摘自Tutorial for Dynamic Programming: Dynamic program […]

标签:,

Copyright © 2013-2017 我的站点 All rights reserved.
This site is using the Desk Mess Mirrored theme, v2.5, from BuyNowShop.com.