TADM2E 8.1

From Algorithm Wiki
Revision as of 06:50, 10 July 2018 by Smarth (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

This is the regular editing dynamic programming, except that the diagonal as an extra possibility when a swap is possible.

M[i, j] = M[i-2, j-2] + 1 ; if A[i] == B[j-1] and A[i-1] == B[j] where i,j > 1