package test.leecode.number;
import java.util.Arrays;
import java.util.List;
import org.junit.Assert;
import org.junit.Test;
import cn.fansunion.leecode.number.SelfDividingNumbers;
/**
* @author wen.lei@brgroup.com
*
* 2022-2-17
*/
public class SelfDividingNumbersTest {
@Test
public void test() {
SelfDividingNumbers sdn = new SelfDividingNumbers();
List<Integer> list21=Arrays.asList();
Assert.assertEquals(list21, sdn.selfDividingNumbers(21, 21));
List<Integer> list122=Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22);
Assert.assertEquals(list122, sdn.selfDividingNumbers(1, 22));
List<Integer> list1212=Arrays.asList(1212);
Assert.assertEquals(list1212, sdn.selfDividingNumbers(1212, 1212));
//assertArrayEquals
}
//基础方法也需要测试
@Test
public void testPointDigitList() {
SelfDividingNumbers sdn = new SelfDividingNumbers();
List<Integer> list21=Arrays.asList(1,2);
Assert.assertEquals(list21, sdn.pointDigitList(21));
List<Integer> list222=Arrays.asList(2,2,2);
Assert.assertEquals(list222, sdn.pointDigitList( 222));
List<Integer> list12345=Arrays.asList(5,4,3,2,1);
Assert.assertEquals(list12345, sdn.pointDigitList(12345));
//assertArrayEquals
}
}
|