Difference between revisions of "TADM2E 8.1"

Revision as of 06:50, 10 July 2018

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

Revision as of 08:29, 11 January 2017 (view source) Joky (talk \| contribs) ← Older edit		Revision as of 06:50, 10 July 2018 (view source) Smarth (talk \| contribs) Newer edit →
Line 1:		Line 1:
−	This is the regular editing dynamic programming, except that the diagonal as an extra possibility ~~with cost = -1~~ when a swap is possible.	+	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-1, j-1] - 1 ; if A[I] == B[j-1] and A[I-1] == B[j]	+	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