Java入门笔记-1[数组]

1、求数组中的最大值

		 /**
         * 判断数组中的最大值
         */
        int[] i = {1, 1, 3, -1, 12, 12, 1, 3, 3, -9, 1,3};
        int max = 0;
        for (int a = 0; a < i.length; a++) {
            if (i[a] > max) max = i[a];
        }
        System.out.println(max);

2、求数组中的最小值

        /**
         * 判断数组中的最小值
         */
        int min = 0;
        for (int a = 0; a < i.length; a++) {
            if (i[a] < min) min = i[a];
        }
        System.out.println(min);
        System.out.println("------");

3、求数组中的众数

        /**
         * 求数组的众数
         */
        Map map = new HashMap();
        for (int s1 = 0; s1 < i.length; s1++) {
            int s3 = 1;
            for (int s2 = 0; s2 < i.length - 1; s2++) {
                if (i[s1] == i[s2 + 1] && s1 != s2 + 1) {
                    s3++;
                    i.clone();
                    map.put(i[s1], s3);
                }
            }
        }
        int maxNum = 0, out = 0, maxkey = 0;
        for (Object key : map.keySet()) {
            if (out == 0) {
                maxNum = (int) map.get(key);
                maxkey = (int) key;
                out++;
            } else if (maxNum < (int) map.get(key)) {
                maxNum = (int) map.get(key);
                maxkey = (int) key;
            }
        }
        System.out.println("众数为：" + maxkey);

4、求数组中的中位数

        /**
         * 求数组的中位数
         */
        int median = 0, tmp = 0, mMax = 0;

        /*
         *首先将数组从小到大依次排列
         * 冒泡排序
         */
        for (int x = 0; x < i.length - 1; x++) {
            for (int a = 0; a < i.length - x - 1; a++) {
                if (i[a] > i[a + 1]) {
                    tmp = i[a];
                    i[a] = i[a + 1];
                    i[a + 1] = tmp;
                }
            }
        }
        for (int s : i) {
            System.out.print(s+"  ");
            //打印数组是否顺序排列
        }
        int num = 0, a = 0;
        if (i.length % 2 == 0) {
            a = i.length / 2;
            num = (i[a] + i[a - 1]) / 2;
        } else {
            a = (i.length - 1) / 2;
            num = i[a];
        }
        System.out.println("中位数为：" + num);