- public static void Tafa() {
- int points[] = new int[] {18,25,7,36,13,2,89,63};
- int min = 0;
- int index = points.length;
- min = points[0];
- for (int i = 0; i < points.length; i++) {
- if(min>points[i]) {
- min = points[i];
- index = i;
- }
- }
- System.out.println("最低的积分为:"+min);
- System.out.println("最低的积分的下标为:"+index);
- }
第七章2
猜你喜欢
转载自blog.csdn.net/qq3144836446/article/details/80225621
今日推荐
周排行