动态规划
class Solution {
public int translateNum(int num) {
char[] ch = String.valueOf(num).toCharArray();
int n = ch.length;
int[] dp = new int[n + 1];
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i <= n; i++){
if(ch[i - 2] == '1' || ch[i - 2] == '2' && ch[i - 1] <= '5'){
dp[i] = dp[i - 1] + dp[i - 2];
}else dp[i] = dp[i - 1];
}
return dp[n];
}
}