[Python] Simple DP 9 Lines
\nclass Solution:\n    def nthUglyNumber(self, n: int) -> int:\n        k = [0] * n\n        t1 = t2 = t3 = 0\n        k[0] = 1\n        for i in range(1,n):\n 
```\nclass Solution:\n    def nthUglyNumber(self, n: int) -> int:\n        k = [0] * n\n        t1 = t2 = t3 = 0\n        k[0] = 1\n        for i in range(1,n):\n            k[i] = min(k[t1]*2,k[t2]*3,k[t3]*5)\n            if(k[i] == k[t1]*2): t1 += 1\n            if(k[i] == k[t2]*3): t2 += 1\n            if(k[i] == k[t3]*5): t3 += 1\n        return k[n-1]\n```\nRuntime: 72%
['Dynamic Programming', 'Python', 'Python3']