Long Common Subsequence

• 方法： 1.爆收 太慢，exponential 2.DP
• Dynamic Programming 1.定optimum-value-function
  2.Recurrent
  boundary condition : l(a, []) = l([], b) = 0
  3.找出答案