leetcode 263. 丑数

	class Solution {
public:
    bool isUgly(int num) {
      int d[]={2,3,5};//丑数的数组
      for(auto p:d)
      while(num>0&&num%p==0)//能被整除
      num/=p;
      return num==1;
    
    }
};