<p>An <strong>ugly number</strong> is a positive integer whose prime factors are limited to <code>2</code>, <code>3</code>, and <code>5</code>.</p>

<p>Given an integer <code>n</code>, return <em>the</em> <code>n<sup>th</sup></code> <em><strong>ugly number</strong></em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> 12
<strong>Explanation:</strong> [1, 2, 3, 4, 5, 6, 8, 9, 10, 12] is the sequence of the first 10 ugly numbers.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 1
<strong>Explanation:</strong> 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 1690</code></li>
</ul>

class Solution {
public:
    int nthUglyNumber(int n) {
        int arr[n];
        arr[0]=1;
        int i1=0;int i2=0;int i3=0;
        int a,b,c,m;
        for(int j=1;j<n;j++){
            a=arr[i1]*2;
            b=arr[i2]*3;
            c=arr[i3]*5;
            m=min(a,b);
            m=min(m,c);
            arr[j]=m;
            if(m==a){
                i1++;
            }
            if(m==b){
                i2++;
            }
            if(m==c){
                i3++;
            }
        }
       return arr[n-1];
    }
};
8034