(int left, int right)
| 1 | class Solution { |
| 2 | public List<Integer> selfDividingNumbers(int left, int right) { |
| 3 | LinkedList list = new LinkedList(); |
| 4 | for(int i = left; i <= right; i++) { |
| 5 | if(isSelfDiving(i)) |
| 6 | list.add(i); |
| 7 | } |
| 8 | return list; |
| 9 | } |
| 10 | |
| 11 | public boolean isSelfDiving(int num) { |
| 12 | int digit = num % 10; |
nothing calls this directly
no test coverage detected