JAVA_Self Dividing Numbers_LeetCode 728

JAVA_Self Dividing Numbers_LeetCode 728 풀이 class Solution { public List<Integer> selfDividingNumbers(int left, int right) { List<Integer>res=new ArrayList(); for(int i=left;i<=right;i++) if(div(i)) res.add(i); return res; } public boolean div(int num){ int n=num; while(n > 0){ int rem = n % 10; if(rem == 0 || (num % rem) != 0) return false; n = n / 10; } return true; } } * 출처 Self Dividing Numbers - LeetCode Self Dividing Numbers - A self-dividing number is a number that is divisible by every di...

원문링크 : JAVA_Self Dividing Numbers_LeetCode 728