class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> answer;
int temp = 0, div = 0;
for(int i = left; i <= right; i++) {
temp = i;
bool test = true;
while(temp != 0) {
temp % 10 == 0 ? div = 1 : div = temp % 10;
if(temp % 10 == 0|| i % (div) != 0) {
test =false;
break;
}
temp /= 10;
}
if(test)answer.push_back(i);
}
return answer;
}
};
'Problem Solving > 리트코드(leetcode)' 카테고리의 다른 글
Valid Perfect Square (0) | 2022.01.16 |
---|---|
Sqrt(x) (0) | 2022.01.16 |
Power of Four (0) | 2022.01.16 |
Lemonade Change (0) | 2022.01.16 |
Add Digits (0) | 2022.01.16 |