My study notes of Java.
There are some problems which are not easy to get the solution quickly. But we can transform these problems to other problems to get the solution. This article will introduce some problems which are easy to get the solution. Try to transform your problem to these problems.
Some Leetcode problems can be solved by 0/1 knapsack effectively
Some Leetcode problems can be solved by dp effectively. All problems are related to Longest Increasing Subsequence.
I appreciated my internship in Inuit. I learned a lot and made some notes in this article.
Some Leetcode problems can be solved by dp effectively.
Some Leetcode problems can be solved by dp effectively.