2.游游的you矩阵

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int n = in.nextInt();
        int m = in.nextInt();
        char [][] angle = new char[n][m];
        int p = 0;
        while(in.hasNext()){
            angle[p++] = in.next().toCharArray();
        }     

        int [] hy = new int[n];
        int [] ho = new int[n];
        int [] hu = new int[n];
        int [] ly = new int[m];
        int [] lo = new int[m];
        int [] lu = new int[m];

        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m; ++j){
                if(angle[i][j] == 'y'){
                    hy[i]++;
                    ly[j]++;
                } else if(angle[i][j] == 'o'){
                    ho[i]++;
                    lo[j]++;
                }else if(angle[i][j] == 'u'){
                    hu[i]++;
                    lu[j]++;
                }
            }
        }
        Long sum = 0L;
        for(int i = 0;i < n; ++i){
            for(int j = 0; j < m; ++j){
                if(angle[i][j] == 'y'){
                    sum += lo[j]*hu[i] + lu[j]*ho[i];
                }else if(angle[i][j] == 'o'){
                    sum += ly[j]*hu[i] + lu[j]*hy[i];
                }else if(angle[i][j] == 'u'){
                    sum += ly[j]*ho[i] + lo[j]*hy[i];
                }
            }
        }
        System.out.println(sum);
    }
}