[LeetCode] Decode Ways

A message containing letters from A-Z is being encoded to numbers using the following mapping:

'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total number of ways to decode it.

For example,
Given encoded message "12", it could be decoded as "AB" (1 2) or "L" (12).

The number of ways decoding "12" is 2

这题很显然的动态规划思想，不过要注意一些细节，第一个数字如果为“0”是没有decode方法的，直接返回0

public class Solution {
    public int numDecodings(String s) {
        if (s == null || s.length() < 1) {
            return 0;
        }    
        if (s.charAt(0) == '0') {
            return 0;
        }
        
        int num1 = 1;
        int num2 = 1;
        int num3 = 1;
        
        for (int i = 1; i < s.length(); i++) {
            num3 = 0;
            char curChar = s.charAt(i);
            if (curChar >= '1' && curChar <= '9') {
                num3 += num2;
            }
            
            char preChar = s.charAt(i - 1);
            if ((preChar == '1' && curChar >= '0' && curChar <= '9') || (preChar == '2' && curChar >= '0' && curChar <= '6')) {
                num3 += num1;
            }
            
            num1 = num2;
            num2 = num3;
        }
        
        return num3;
    }
}