//使用遍历判断的方法

 class Solution01 {

 public:

     int GetUglyNumber_Solution(int index) {

         if (index < )return ;

         int cnt = ;

         for (int i = ; cnt < index; ++i)

         {

             if (isChouShu(i))

                 cnt++;

             if (cnt == index)

                 return i;

         }

     }

     bool isChouShu(int num)

     {

         while (num %  == )

             num /= ;

         while (num %  == )

             num /= ;

         while (num %  == )

             num /= ;

         return num == ;

     }

 };

 //使用保存数据法

 class Solution02 {

 public:

     int GetUglyNumber_Solution(int index) {

         if (index < )return ;

         vector<int>v(index, );

         v[] = ;

         int p2, p3, p5, k = ;

         p2 = p3 = p5 = ;

         while (k < index)

         {

             v[k++] = min(min(v[p2] * , v[p3] * ), v[p5] * );

             while (v[p2] *  <= v[k - ])p2++;

             while (v[p3] *  <= v[k - ])p3++;

             while (v[p5] *  <= v[k - ])p5++;

         }

         return v[index - ];

     }

 };