第二次作业
第二次作业
本次作业通过eclipse的JUnit对一个封装了求数组最大子序列的类进行单元测试。
1. 被测试类的代码及截图
- 代码:
package wangtaihua.junit;
import java.util.Scanner;
public class TJUnit {
public int Find(int[] array) {
if (array == null || array.length == 0) {
return Integer.MIN_VALUE;
}
int currSum = Integer.MIN_VALUE;
int maxSum = Integer.MIN_VALUE;
for (int i = 0; i < array.length; i++) {
currSum = (currSum < 0) ? array[i] : currSum + array[i];
if (currSum > maxSum) maxSum = currSum;
}
return maxSum;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String str = scanner.nextLine().toString();
String arrString[] = str.split(",");
int[] arr= new int[arrString.length];
for(int i = 0; i < arrString.length; i++){
arr[i] = Integer.parseInt(arrString[i]);
}
scanner.close();
TJUnit g = new TJUnit();
int result = g.Find(arr);
System.out.println("最大子列的值为:"+result);
}
}
- 界面截图:
2.测试类代码及截图
- 代码:
package wangtaihua.junit;
import static org.junit.Assert.*;
import org.junit.Test;
public class TestTJUnit {
@Test
public void testFind() {
int a[] = new int[]{5,6,8,-10,5,9};
int result = new TJUnit().Find(a);
assertEquals(23,result);
}
}
- 界面截图: