Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

【算法】动态规划经典题型 | LOUIS' BLOG #76

Open
isLouisHsu opened this issue Jun 23, 2020 · 0 comments
Open

【算法】动态规划经典题型 | LOUIS' BLOG #76

isLouisHsu opened this issue Jun 23, 2020 · 0 comments

Comments

@isLouisHsu
Copy link
Owner

https://louishsu.xyz/2020/06/23/%E3%80%90%E7%AE%97%E6%B3%95%E3%80%91%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%BB%8F%E5%85%B8%E9%A2%98%E5%9E%8B/

目录 目录 解题思路 零钱兑换 零钱兑换 I: 最少硬币个数 零钱兑换 II: 硬币组合数 背包问题II: 0-1背包 青蛙跳台阶问题 *青蛙过河问题 最小编辑距离 最大子序和问题 最长回文子串 最长递增子序列问题, LIS 最长公共子串 最长公共子序列问题, LCS *买卖股票的最佳时机 买卖股票的最佳时机 I: 一次交易 买卖股票的最佳时机 II: 无穷多次交易 买卖股票的最佳时机 III

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant