[Python] Clean DFS+DP
Clean DFS+DP\npython\ndef add(s, a):\n    return \'\'.join([str((int(x) + a)%10) if i%2==1 else x for i, x in enumerate(s)])\n\ndef move(s, b):\n    return \'\'
Clean DFS+DP\n```python\ndef add(s, a):\n    return \'\'.join([str((int(x) + a)%10) if i%2==1 else x for i, x in enumerate(s)])\n\ndef move(s, b):\n    return \'\'.join([s[i - b] for i in range(len(s))])\n\nclass Solution:\n    def dp(self, s):\n        if s in self.visited:\n            return\n        if int(self.min_s) > int(s):\n            self.min_s = s\n        self.visited.add(s)        \n        self.dp(add(s, self.a))        \n        self.dp(move(s, self.b))              \n        \n    def findLexSmallestString(self, s: str, a: int, b: int) -> str:\n        self.visited = set()\n        self.min_s = s\n        self.a = a\n        self.b = b\n        self.dp(s)\n        return self.min_s\n```\n\n\t
['Python', 'Python3']