1 Star 7 Fork 2

蔚蔚樱软件开发/AlgoHub

加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
LargestSquareViolenceTest.java 5.05 KB
一键复制 编辑 原始数据 按行查看 历史
ljfirst 提交于 2022-10-31 23:58 +08:00 . feat: update
package UnitTest.AlgorithmTest.dynamicTest.largestSquareTest;
import Algorithm.dynamic.largestSquare.LargestSquare_Violence;
import org.junit.Test;
/**
* @author 蔚蔚樱
* @version 1.0
* @date 2020/6/3
* @author—Email micromicrohard@outlook.com
* @blogURL https://blog.csdn.net/Micro_Micro_Hard
* @description 最大正方形的测试案例
*/
public class LargestSquareViolenceTest extends LargestSquareTest {
LargestSquare_Violence LargestSquare_Violence = new LargestSquare_Violence();
@Test
public void testSolution() {
super.testSolution(LargestSquare_Violence);
}
//UT:暴力循环扫描法(含冗余扫描)
@Test
public void getMaxSideLengthViolenceTest(){
//测试用例01,起始点:(0,0),最大边长:2,期望值为2
int bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test01,0,0);
assert bound_value == 2;
//测试用例02:起始点:(1,1),最大边长:3,期望值为3
Square_Test01 = null;
bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test02,1,1);
assert bound_value == 3;
//测试用例03:起始点:无或者(0,0),最大边长:0,期望值为0
bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test03,0,0);
assert bound_value == -1;
//测试用例04:起始点:(5,5),最大边长:0,越界,期望值为0
bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test04,5,5);
assert bound_value == -2;
//测试用例05:起始点:(2,1),最大边长:2,
bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test05,2,1);
assert bound_value == 2;
//测试用例06:起始点:(1,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test06,1,1);
assert bound_value == 2;
//测试用例07:起始点:(1,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthViolence(Square_Test07,1,1);
assert bound_value == 2;
}
//逐层扫描法
@Test
public void getMaxSideLengthScannerTest(){
//测试用例01,起始点:(0,0),最大边长:2,期望值为2
int bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test01,0,0);
assert bound_value == 2;
//测试用例02:起始点:(1,1),最大边长:3,期望值为3
Square_Test01 = null;
bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test02,1,1);
assert bound_value == 3;
//测试用例03:起始点:无或者(0,0),最大边长:0,期望值为0
bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test03,0,0);
assert bound_value == -1;
//测试用例04:起始点:(5,5),最大边长:0,越界,期望值为0
bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test04,5,5);
assert bound_value == -2;
//测试用例05:起始点:(2,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test05,2,1);
assert bound_value == 2;
//测试用例06:起始点:(1,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test06,1,1);
assert bound_value == 2;
//测试用例07:起始点:(1,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthScanner(Square_Test07,1,1);
assert bound_value == 2;
}
//最大长度限制法
@Test
public void getMaxSideLengthLimit(){
//测试用例01,起始点:(0,0),最大边长:2,期望值为2
int bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test01,0,0);
assert bound_value == 2;
//测试用例02:起始点:(1,1),最大边长:3,期望值为3
Square_Test01 = null;
bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test02,1,1);
assert bound_value == 3;
//测试用例03:起始点:无或者(0,0),最大边长:0,期望值为0
bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test03,0,0);
assert bound_value == -1;
//测试用例04:起始点:(5,5),最大边长:0,越界,期望值为0
bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test04,5,5);
assert bound_value == -2;
//测试用例05:起始点:(2,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test05,2,1);
assert bound_value == 2;
//测试用例06:起始点:(1,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test06,1,1);
assert bound_value == 2;
//测试用例07:起始点:(1,1),最大边长:2,期望值为2
bound_value = LargestSquare_Violence.getMaxSideLengthLimit(Square_Test07,1,1);
assert bound_value == 2;
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/micromicrohard/algo-hub.git
git@gitee.com:micromicrohard/algo-hub.git
micromicrohard
algo-hub
AlgoHub
master

搜索帮助