MCPcopy
hub / github.com/qiyuangong/leetcode / selfDividingNumbers

Method selfDividingNumbers

java/728_Self_Dividing_Numbers.java:2–9  ·  view source on GitHub ↗
(int left, int right)

Source from the content-addressed store, hash-verified

1class 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;

Callers

nothing calls this directly

Calls 2

isSelfDivingMethod · 0.95
addMethod · 0.45

Tested by

no test coverage detected