1309. Decrypt String from Alphabet to Integer Mapping

简单题，但是要从后往前推。刚刚一直卡在一个字符串加法中。字符串相加，要按照

string num="";
num = num + s[jj-2]+s[jj-1]; // "25"           

class Solution {
public:
    
    char num2char(string num){
        char z = atoi(num.c_str())-1+'a';
        return z;
    }
    
    string freqAlphabets(string s) {
        string result="";
        int jj=s.size()-1;
        while(jj>=0){
            if (s[jj]=='#'){
                string num="";
                num = num + s[jj-2]+s[jj-1]; // "25"
                //cout<<num<<endl;
                result = num2char(num) + result;
                jj = jj -3;
            }
            else{
                string num="";
                num = num + s[jj];
                //cout<<num<<endl;
                result = num2char(num) + result;
                jj = jj -1;
            }
        }
        
        return result;
    }
};