264. Ugly Number II

class Solution {
public:
    int nthUglyNumber(int n) {
        if(n<=0)
            return false;
        if(n==1)
            return 1;
        int t2,t3,t5;
        t2=t3=t5=0;
        vector<int> nums(n,1);
        for(int i=1;i<n;i++)
        {
            nums[i]=min(nums[t2]*2,min(nums[t3]*3,nums[t5]*5));
            if(nums[i]==nums[t2]*2)
                t2++;
            if(nums[i]==nums[t3]*3)
                t3++;
            if(nums[i]==nums[t5]*5)
                t5++;
        }
        return nums[n-1];
    }
};