[Python3] tabu search
Please pull this commit for solutions of weekly 333. \n\n\nclass Solution:\n    def findTheString(self, lcp: List[List[int]]) -> str:\n        n = len(lcp)\n   
Please pull this [commit](https://github.com/gaosanyong/leetcode/commit/485c537c6fa9056ce656959ea352d2a68cef473f) for solutions of weekly 333. \n\n```\nclass Solution:\n    def findTheString(self, lcp: List[List[int]]) -> str:\n        n = len(lcp)\n        ans = []\n        for i in range(n): \n            tabu = set()\n            for j in range(i): \n                if lcp[i][j]: \n                    ans.append(ans[j])\n                    break\n                else: tabu.add(ans[j])\n            else: \n                for ch in ascii_lowercase: \n                    if ch not in tabu: \n                        ans.append(ch)\n                        break\n                else: return ""\n        dp = [[0]*n for _ in range(n)]\n        for i in range(n-1, -1, -1): \n            for j in range(n-1, -1, -1): \n                if ans[i] == ans[j]: \n                    if i == n-1 or j == n-1: dp[i][j] = 1\n                    else: dp[i][j] = 1 + dp[i+1][j+1]\n                if dp[i][j] != lcp[i][j]: return ""\n        return "".join(ans)\n```
['Python3']