题目: 题解: class Solution {public:int numDecodings(string s) {int n = s.size();// a = f[i-2], b = f[i-1], c = f[i]int a = 0, b = 1, c;for (int i = 1; i <= n; ++i) {c = 0;if (s[i - 1] != '0') {c += b
思路: 首先我们可以使用暴力递归解法,无非就是每次向下或者向右看看是否有解法,代码如下: public class Solution {public int uniquePaths(int m, int n) {return findPaths(0, 0, m, n);}private int findPaths(int i, int j, int m, int n) {// 如果越界,
题目: 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 tota