ex5.java

讲述各种各样的java初始编程 了解编程

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package chenchao1;

import java.util.*;

/**
 *
 * @author williechen
 */
public class Ex5 {

    public int[][] randomArray;

    public Ex5(int width, int length, int range) {
        int[][] array = new int[width][length];
        Random r = new Random();
        for (int i = 0; i < width; i++) {
            for (int j = 0; j < length; j++) {
                array[i][j] = r.nextInt(range);
            }
        }
        randomArray = array;
    }

    void printArray(int[][] ia) {
        System.out.println("[");
        for (int i = 0; i < ia.length; i++) {
            for (int j = 0; j < ia[i].length; j++) {
                System.out.print(ia[i][j] + "," + "\t");
                if (j == ia[i].length - 1) {
                    System.out.println();
                }
            }
        }
        System.out.println("]");
    }

    boolean isMax(int v, int[] ia) {
        ArrayList<Integer> al = new ArrayList<Integer>();
        for (int i : ia) {
            al.add(i);
        }
        int max = Collections.max(al);
        return (v == max);
    }

    boolean isMin(int v, int[] ia) {
        ArrayList<Integer> al = new ArrayList<Integer>();
        for (int i : ia) {
            al.add(i);
        }
        int min = Collections.min(al);
        return (v == min);
    }

    int[][] getReverse(int[][] ia) {
        int width = ia.length;
        int length = ia[0].length;

        int[][] reverse = new int[length][width];
        for (int i = 0; i < length; i++) {
            for (int j = 0; j < width; j++) {
                reverse[i][j] = ia[j][i];
            }
        }

        return reverse;
    }

    public static void main(String[] args) {
        Ex5 ex5 = new Ex5(4, 6, 20);
        ex5.printArray(ex5.randomArray);
        //int[][] reverse = ex5.getReverse(ex5.randomArray);
        //ex5.printArray(reverse);
        int width = ex5.randomArray.length;
        int length = ex5.randomArray[0].length;
        boolean point = false;
        for (int i = 0; i < width; i++) {
            for (int j = 0; j < length; j++) {
                int k = ex5.randomArray[i][j];
                int[] row = ex5.randomArray[i];
                int[] col = ex5.getReverse(ex5.randomArray)[j];
                if (ex5.isMax(k, row) && ex5.isMin(k, col)) {
                    point = true;
                    System.out.println("point is:" + k + "\t at:" + '[' + (i+1) + ',' + (j+1) + ']');
                    break;
                }
            }
        }
        if (point == false) {
            System.out.println("the Array is no Point");
        }
    }

    /*HashMap<Integer, Integer> getMax(int[][] ia) {
    HashMap<Integer, Integer> max = new HashMap<Integer, Integer>();
    for (int i = 0; i < ia.length; i++) {
    ArrayList<Integer> al = new ArrayList<Integer>();
    for (int j : ia[i]) {
    al.add(j);
    }
    max.put(i, Collections.max(al));
    }
    return max;
    }
    HashMap<Integer, Integer> getMin(int[][] ia) {
    HashMap<Integer, Integer> min = new HashMap<Integer, Integer>();
    int width  = ia.length;
    int length = ia[0].length;
    int[][] reverse = new int[length][width];
    for(int i = 0; i < length; i++)
    for(int j = 0; j < width; j++)
    reverse[i][j] = ia[j][i];
    for (int i = 0; i < reverse.length; i++) {
    ArrayList<Integer> al = new ArrayList<Integer>();
    for (int j : reverse[i]) {
    al.add(j);
    }
    min.put(i, Collections.min(al));
    }
    return min;
    }*/
}