题解 | 字母收集

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    static int getScore(char c){
        switch(c){
            case 'l': 
                return 4;
            case 'o':
                return 3;
            case 'v':
                return 2;
            case 'e':
                return 1;
            default:
                return 0;
        }
    }
    public static void main(String[] args) {        
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        //定义矩阵，用于存放对应的字母
        char[][] arr=new char[n][m];
        for(int i=0;i<n;i++){
            String s=sc.next();
            for(int j=0;j<m;j++){
                arr[i][j]=s.charAt(j);
            }             
        }
        int [][]dp = new int[n][m];
        
        for(int i=0;i<n;++i){
            for(int j=0;j<m;++j){
                if(i == 0&&j == 0){
                    dp[i][j] = getScore(arr[i][j]);
                }else if(j==0){
                    dp[i][j] = dp[i-1][j]+getScore(arr[i][j]);
                }else if(i==0){
                    dp[i][j] = dp[i][j-1]+getScore(arr[i][j]);
                }else{
                    int up = dp[i-1][j]+getScore(arr[i][j]);
                    int left = dp[i][j-1]+getScore(arr[i][j]);
                    dp[i][j] = Math.max(up, left);
                }
            }
        }
        System.out.println(dp[n-1][m-1]);
    }
}