JAVA初学——week10 课本第11章*题

*11.9 (最大的行和列）

import java.util.*;
public class MaximumRowsRndColumns11_9 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter the array size n: ");
        int n = input.nextInt();
        System.out.println("The random array is");
        int[][] a = new int[n][n];
        int[] maxR = new int[n];
        int[] maxC = new int[n];
        int maxr = 0;
        int maxc = 0;
        for(int i = 0; i < n;++ i){
            for(int j = 0;j < n;++ j){
                a[i][j] = (int)(Math.random() * 2);
                System.out.print(a[i][j]);
            }
            System.out.println("");
        }
        int k = 0;
        for(int i = 0; i < n;++ i){
            int x = 0;
            for(int j = 0;j < n;++ j){
                if(a[i][j] == 1){
                    x ++;
                }
            }
            if(x > maxr){
                maxr = x;
                maxR[0] = i;
                k = 1;
            }else if(x == maxr){
                maxR[k] = i;
                k++;
            }
        }
        System.out.print("The largest row index: ");
        for(int i = 0;i < k;++i){
            System.out.print(maxR[i]);
            if(i != k-1){
                System.out.print(" ");
            }else{
                System.out.println("");
            }
        }
        k = 0;
        for(int j = 0; j < n;++ j){
            int x = 0;
            for(int i = 0;i < n;++ i){
                if(a[i][j] == 1){
                    x ++;
                }
            }
            if(x > maxc){
                maxc = x;
                maxC[0] = j;
                k = 1;
            }else if(x == maxc){
                maxC[k] = j;
                k++;
            }
        }
        System.out.print("The largest column index: ");
        for(int i = 0;i < k;++i){
            System.out.print(maxC[i]);
            if(i != k-1){
                System.out.print(" ");
            }else{
                System.out.println("");
            }
        }
    }
}

*11.13 (去掉重复元素）

import java.util.*;

public class RemoveDuplicateElements {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter ten integers: ");
        ArrayList<Integer> a = new ArrayList<Integer>();
        for(int i = 0;i < 10;++i){
            a.add(input.nextInt());
        }
        System.out.print("The distinct integers are ");
        removeDuplicate(a);
    }
    public static void removeDuplicate(ArrayList<Integer> b){
        Set<Integer> setlist = new HashSet<Integer>();//利用集合来去重
        for(int i = 0;i < 10;++i){
            int s = b.get(i);
            if(!setlist.contains(s)){
                System.out.print(s + " ");
                setlist.add(s);
            }
        }
    }
}

*11.15 (凸多边形面积）

import java.util.Scanner;
import java.lang.Math;

public class AreaOfConvexPolygon {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter the number of the points: ");
        int n = input.nextInt();
        float[] x = new float[114514];
        float[] y = new float[114514];
        System.out.println("Enter the coordinates of the points:");
        for(int i = 1;i <= n;++ i){
            x[i] = input.nextFloat();
            y[i] = input.nextFloat();
        }
        float s = 0;
        for(int i = 1;i <= n;++ i){
            if(i != n){
                s += x[i] * y[i+1] - x[i+1] * y[i];
            }else{
                s += x[n] * y[1] - x[1] * y[n];
            }
        }
        s = Math.abs(s / 2);
        System.out.print("The total area is ");
        System.out.println(String.format("%.3f",s));
    }
}