[leetcode] problem 264 – ugly number ii

public int (int n) {
    int[] ugly = new int[n];
    int t2 = 0;
    int t3 = 0;
    int t5 = 0;

    ugly[0] = 1;

    for (int i = 1; i < n; i++) {
        ugly[i] = Math.min(2 * ugly[t2], Math.min(3 * ugly[t3], 5 * ugly[t5]));

        if (ugly[i] == 2 * ugly[t2])
            t2++;

        if (ugly[i] == 3 * ugly[t3])
            t3++;

        if (ugly[i] == 5 * ugly[t5])
            t5++;
    }

    return ugly[n-1];
}