题解 | 数独数组

import java.util.Scanner;

public class Main{
    static Scanner in = new Scanner(System.in);
    public static void main(String[] args){
        int n = in.nextInt();
        int[] a = new int[n+5];
        for(int i = 1; i <= n; i++) a[i] = in.nextInt();
        int[] cnt = new int[10];
        for(int i = 1; i <= n; i++) cnt[a[i]] ++;
        int maxn = 0;
        for(int i = 1; i <= 9; i++) maxn = Math.max(maxn, cnt[i]);
        boolean flag = true;
        for(int i = 1; i <= 9; i++) 
            if(cnt[i] < maxn - 1){
                flag = false;
                break;
            }
        if(flag) System.out.println("YES");
        else System.out.println("NO");
    }
}