//url:https://leetcode.com/problems/self-dividing-numbers/description/
class Solution {
public:
vector selfDividingNumbers(int left, int right) {
vector result;
for(int i=left;i<=right;i++){
int n=i;
bool isDividingNum=true;
while(n){
if(0==n%100!=(i%(n%10))){
isDividingNum=false;
break;
}
n/=10;
}
if(isDividingNum)
result.push_back(i);
}
return result;
}
};
- 本文作者: royalchen
- 本文链接: http://www.royalchen.com/2018/07/23/leetcode-728-self-dividing-numbers/
- 版权声明: 本博客所有文章除特别声明外,均采用 MIT 许可协议。转载请注明出处!