public class Solution {
public bool IsUgly(int num) {
if(num <=) return false;
if(num==) return true;
while(num/*==num){
num = num/;
}
while(num/*==num){
num = num/;
}
while(num/*==num){
num = num/;
}
return num==?true:false;
}
}
相关文章
- 10-10405. Convert a Number to Hexadecimal
- 10-10(lleetcode)Single Number
- 10-10变量存储缓存机制 Number (int bool float complex)
- 10-10Contest 176 - LeetCode 1353. Maximum Number of Events That Can Be Attended (贪心)
- 10-10变量类型-Number
- 10-10input[type=number]问题
- 10-10CF1454E Number of Simple Paths(容斥+基环树)
- 10-10cf C On Number of Decompositions into Multipliers
- 10-10BZOJ2911 : [Poi1997]The Number of Symmetrical Choices
- 10-10Codeforces Round #674 (Div. 3) F. Number of Subsequences 题解(dp)