C++ python Mahonian三角四項遞迴公式解Leetcode難題629 K Inverse Pairs Array

C++ python Mahonian三角四項遞迴公式解Leetcode難題629  K Inverse Pairs Array

Fact 1 is for better writing f(n, k)=\sum_{j=0}^{n-1}f(n-1, k-j)

Leetcode 629. K Inverse Pairs Array解這類的Leetcode難題，先導一導數學式，

python C++遞迴邁向dp動態規劃解Leetcode 1143 Longest Common Subsequence

python C++遞迴邁向dp動態規劃解Leetcode 1143  Longest Common Subsequence. LCS之類的問題其實跟 DNA 序列的比對問題密切關聯。非常經典的DP動態規劃問題，有的人會TLE，請注意不是只設cache就好，尤其是C++，字串不要call-by-value 

C++ python使用DFS與奇偶測試解Leetcode1457 Pseudo Palindromic Paths in a Binary ...

C++ python使用DFS與奇偶測試解Leetcode1457  Pseudo Palindromic Paths in a Binary Tree

C++遞迴試所有組合bitset解Leetcode 1239 Maximum Length of a Concatenated String ...

C++遞迴試所有組合bitset解Leetcode 1239  Maximum Length of a Concatenated String with Unique Characters。

Python C++動態規劃DP解Leetcode 198 House Robber

Python C++動態規劃DP解Leetcode 198  House Robber