2024-07-11
한어Русский языкEnglishFrançaisIndonesianSanskrit日本語DeutschPortuguêsΕλληνικάespañolItalianoSuomalainenLatina
115. Different Subsequences - LeetCode
Idea: dp[i][j]: the number of t ending with j-1 in the subsequence of s ending with i-1. dp[i][j] still considers two cases:
s[i - 1] ==
I have devoted myself to the research of technology for more than 30 years. I am proficient in various languages such as Java, Linux, JavaScript, PHP, CSS, etc. I have made many contributions in the field of open source. I have established a developer documentation site to share some problems in technology development for everyone to read.
