Leet Code OJ 91 解码方法

 dfs+打表或者动态规划

string t;
long long int cnt = 0;
int vis[100000][3];
int dfs(int cur, int bit)
{
	if (vis[cur][bit] > 0)
		return vis[cur][bit];
	if (bit == 2)
	{
		if ((t[cur] - '0') * 10 + t[cur + 1] - '0' >= 27 || t[cur] == '0')
			return 0;
	}
	if (bit == 1)
	{
		if (t[cur] == '0')
			return 0;
	}
	if (cur <= 0)
		return 0;
	if (cur == 1)
	{
		if (t[0] > '0')
			return 1;
		return 0;
	}
	if (cur == 2)
	{
		if ((t[0] - '0') * 10 + t[1] - '0' < 27 && t[0] != '0')
		{
			if (t[1] > '0')
				return 2;
			return 1;
		}
	}
	return vis[cur][bit] = dfs(cur - 1, 1) + dfs(cur - 2, 2);
}
int numDecodings(string s)
{
	t = s;
	cnt = 0;
	memset(vis, 0, sizeof(vis));
	return dfs(t.size(), 0);
}

动态规划

int numDecodings(string s) {
    if (s[0] == '0') return 0;
    int pre = 1, curr = 1;//dp[-1] = dp[0] = 1
    for (int i = 1; i < s.size(); i++) {
        int tmp = curr;
        if (s[i] == '0')
            if (s[i - 1] == '1' || s[i - 1] == '2') curr = pre;
            else return 0;
        else if (s[i - 1] == '1' || (s[i - 1] == '2' && s[i] >= '1' && s[i] <= '6'))
            curr = curr + pre;
        pre = tmp;
    }
    return curr;
}