Support an Omissive Test Case
Some code(example1, example2) only checks this two constraints:\n\n1. if lcp[i][j] == 0 then str[i] != str[j]\n2. if lcp[i][j] < n - j then str[i + lcp[i][j]] !
Some code([example1](https://leetcode.com/submissions/detail/900802586/), [example2](https://leetcode.com/submissions/detail/901252948/)) only checks this two constraints:\n\n1. if lcp[i][j] == 0 then str[i] != str[j]\n2. if lcp[i][j] < n - j then str[i + lcp[i][j]] != str[j + lcp[i][j]]\n\nbut also got Accepted! \n\nHere is a new case which can make it get Wrong Answer.\n\n```\n[[5,0,2,0,0],[0,4,0,0,0],[2,0,3,0,0],[0,0,0,2,0],[0,0,0,0,1]]\n```\n
['Python3']