java int的最小值,查找数组中int数的最小值(Java)

I'm trying to find the minimum value of numbers in an array but it doesn't always work out properly. This is the code I wrote:

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

min = arr[i];

for (j=0; j < arr.length; j++) {

if (arr[j] < arr[0]) {

min = arr[j];

}

}

}

Can someone correct me please?

解决方案

There's no need for the outer loop, it only runs once and you don't use i anyway. why do you have it?

For the inner loop, you need to compare against the minimum value. Right now you are comparing it against the first element in the array, which is not necessarily the minimum value.

min = arr[0];

for (j=0; j < arr.length; j++) {

if (arr[j] < min) { //

min = arr[j];

}

}

Also you could start the loop at 1, since you don't need to compare arr[0] against itself (it was just assigned to min)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值