【从0到1冲刺蓝桥杯】每日一题——解码方法(动态规划)
解码方法https://leetcode-cn.com/problems/decode-ways/
题目描述:
解题思路:
动态规划
class Solution {public: int numDecodings(string s) { int n = s.size(); vector f(n + 1); f[0] = 1; for (int i = 1; i 1 && s[i - 2] != '0' && ((s[i - 2] - '0') * 10 + (s[i - 1] - '0') <= 26)) { f[i] += f[i - 2]; } } return f[n]; }};
方法:
动态规划