Question

• lintcode: (77) Longest Common Subsequence

Question

• lintcode: (117) Jump Game II

Question

• leetcode: Interleaving String | LeetCode OJ
• lintcode: (29) Interleaving String

Question

• leetcode: Edit Distance | LeetCode OJ
• lintcode: (119) Edit Distance

Question

• leetcode: Distinct Subsequences
• lintcode: Distinct Subsequences

Question

• leetcode: Best Time to Buy and Sell Stock IV | LeetCode OJ
• lintcode: (393) Best Time to Buy and Sell Stock IV

Question

• leetcode: Best Time to Buy and Sell Stock III | LeetCode OJ
• lintcode: (151) Best Time to Buy and Sell Stock III

如何解决训练样本少的问题

目前大部分的深度学习模型仍然需要海量的数据支持。例如 ImageNet 数据就拥有1400多万的图片。而现实生产环境中，数据集通常较小，只有几万甚至几百个样本。这时候，如何在这种情况下应用深度学习呢?

Question

• leetcode: Best Time to Buy and Sell Stock | LeetCode OJ
• lintcode: (149) Best Time to Buy and Sell Stock

Question

• lintcode: (125) Backpack II

Problem Statement

Given n items with size \[Ai\] and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack?