软件测试二

public int findLast (int[] x, int y) {

//Effects: If x==null throw

NullPointerException

// else return the index of the last element

// in x that equals y.

// If no such element exists, return -1

for (int i=x.length-1; i > 0; i--)

{

if (x[i] == y)

{

return i;

}

}

return -1;

}

// test: x=[2, 3, 5]; y = 2

// Expected = 0

 

 

  1. Faultfor循环中应为i>=0

 

  1. Not executex=null ; y=3

 

  1. Not result in an error state: x=[3,3,3]; y=3

 

  1. Results in an error, but not a failurex=[0,0,0]; y=3

 

 

 

public static int lastZero (int[] x) {

//Effects: if x==null throw

NullPointerException

// else return the index of the LAST 0 in x.

// Return -1 if 0 does not occur in x

for (int i = 0; i < x.length; i++)

{

if (x[i] == 0)

{

return i;

}

} return -1;

}

// test: x=[0, 1, 0]

// Expected = 2

 

  1. Fault:  for循环应为for(int i=x.length-1;i>=0;i--)

 

  1. Not executex=null ; y=3

 

  1. Not result in an error state:  x=[3]

 

  1. Results in an error, but not a failurex=[1,1,0]

 

 

 

转载于:https://www.cnblogs.com/c-czl123/p/8570541.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值