动态规划求最长公共子串出错

#coding:utf-8
'''
请编写一个函数，输入两个字符串，求它们的最长公共子串，并打印出最长公共子串。
输入：inputSeq1、inputSeq2
返回：outputSubSeq
若输入Seq存在None或空，则返回None
'''

class Demo:
    def findMaxSubSeq(self, str1, str2):
        if str1 == "" or str1 == None \
            or str2 == "" or str2 == None:
            return None
        len1 = len(str1)
        len2 = len(str2)
        c = [[0 for i in range(len2 + 1)] for j in range(len1 + 1)]
        flag = [[None for i in range(len2 + 1)] for j in range(len1 + 1)]
        for i in range(len1):
            for j in range(len2):
                if str1[i] == str2[j]:
                    c[i + 1][j + 1] = c[i][j] + 1
                    flag[i+1][j+1] = "ok"
                elif c[i + 1][j] > c[i][j + 1]:
                    c[i + 1][j + 1] = c[i + 1][j]
                    flag[i + 1][j + 1] = "left"
                else:
                    c[i + 1][j + 1] = c[i][j+1]
                    flag[i + 1][j + 1] = "up"

        i = len1
        j = len2
        count = c[len1][len2]
        s = []
        while i > 0 and j > 0 and count > 0:
            f = flag[i][j]
            if f == "ok":
                s.append(str1[i - 1])
                j -= 1
                i -= 1
                count -= 1
            elif f == "left":
                j -= 1
            else:
                i -= 1
        s.reverse()
        return ''.join(s)

输入 “abdxdef” 和 “abcdef”.

在str1的x与str2的c匹配之后，此时其实是失配状态，得到c[4][3]=3,就是abc.
当str1到d时，会有str2的d与其相等，这个时候回更新c[5][4]=c[4][3]+1,但是其实 c[4][3]是失配的，所以不应该是4.

怎么解决？