CCF计算机软件能力认证201409前两题java满分解

zyc534927618

已于 2024-03-16 14:51:04 修改

阅读量280

点赞数 4

文章标签： java 算法数据结构

于 2024-03-16 14:49:55 首次发布

本文链接：https://blog.csdn.net/zyc534927618/article/details/136762663

版权

文章介绍了两个Java编程竞赛题目，涉及数组排序、查找最小值和最大值，以及二维矩阵的遍历和计数操作。

摘要由CSDN通过智能技术生成

第一题

package ccf201409;

import java.util.Arrays;
import java.util.Scanner;

public class p1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] s = new int[n];
        int count = 0;
        for (int i = 0; i < n; i++) {
            s[i] = sc.nextInt();
        }
        Arrays.sort(s);
        for (int j = 1; j < n; j++) {
            if (s[j] - 1 == s[j - 1]) count++;
        }
        System.out.println(count);
    }
}

第二题

package ccf201409;

import java.util.Scanner;

public class p2f {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] xy = new int[n][4];

        int minX = 1000;
        int minY = 1000;
        int maxX = 0;
        int maxY = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 4; j++) {
                xy[i][j] = sc.nextInt();
                if (j == 0 || j == 2) {
                    if (xy[i][j] < minX) {
                        minX = xy[i][j];
                    }
                    if (xy[i][j] > maxX) {
                        maxX = xy[i][j];
                    }
                }
                if (j == 1 || j == 3) {
                    if (xy[i][j] < minY) {
                        minY = xy[i][j];
                    }
                    if (xy[i][j] > maxY) {
                        maxY = xy[i][j];
                    }
                }
            }
        }
        int[][] map = new int[maxX + 1][maxY + 1];
        System.out.println(getS(map, xy, maxX, maxY));
    }

    public static int getS(int[][] map, int[][] xy, int maxX, int maxY) {
        int count = 0;
        for (int i = 0; i < xy.length; i++) {
            for (int j = xy[i][1]; j < xy[i][3]; j++) {
                for (int k = xy[i][0]; k < xy[i][2]; k++) {
                    map[k][j] = 1;
                }
            }
        }
        for (int j = 0; j <= maxY; j++) {
            for (int i = 0; i <= maxX; i++) {
                if (map[i][j] == 1)
                    count++;
            }
        }
        return count;
    }
}