题解 | #数组遍历#

数组遍历

https://www.nowcoder.com/practice/0f8219cb6f6e4e99a1bb0e868e51d60a

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int[] ary = new int[6];
        int max;
        int min;
        Scanner scanner = new Scanner(System.in);
     	for (int i = 0; i <ary.length ; i++) {
            ary[i]=scanner.nextInt();
        }

        //write your code here......
        // for(int i = 0; i < ary.length - 1;i++){
        //     for(int j = 0;j < ary.length -1 - i;j++){
        //         if(ary[j] > ary[j+1]){
        //             int temp = ary[j];
        //             ary[j] = ary[j+1];
        //             ary[j+1] = temp;
        //         }
        //     }
        // }
        for(int i = 0; i < ary.length - 1;i++){
            for(int j = i + 1; j < ary.length;j++){
                if(ary[i] > ary[j]){
                    int temp = ary[j];
                    ary[j] = ary[i];
                    ary[i] = temp;
                }
            }
        }
        max = ary[ary.length-1];
        min = ary[0];

        System.out.println(max+" "+min);
    }
}

全部评论

相关推荐

不愿透露姓名的神秘牛友
昨天 10:46
点赞 评论 收藏
分享
牛客279957775号:铁暗恋
点赞 评论 收藏
分享
点赞 收藏 评论
分享
牛客网
牛客企业服务