【CCF 201709-3】JSON查询

思路1：并没有采用递归化的策略，而是根据查询直接在源字符串中查找。（90分）

#include <iostream>
#include <cstring>
#include <vector>
using namespace std;

//   esc\aped -> "esc\\aped":
string sour(const string& t)
{
    string res;
    for(size_t i = 0; i < t.size(); ++i)
    {
        if(t[i] == '\\') res += "\\\\";
        else if(t[i] == '\'') res += "\\\'";
        else res += t[i];
    }
    res = "\"" + res + "\":";
    return res;
}

//    \"hello\"  ->  "hello"
string tran(const string& t)
{
    string res;
    for(size_t i = 0; i < t.size();)
    {
        if(i < t.size() - 1 && t[i] == '\\' && t[i + 1] == '\\')
        {
            res += '\\';
            i += 2;
        }
        else if(i < t.size() - 1 && t[i] == '\\' && t[i + 1] == '\"')
        {
            res += '\"';
            i += 2;
        }
        else
        {
            res += t[i];
            ++i;
        }
    }
    return res;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //输入
    int n, m;
    cin >> n >> m;
    cin.get();
    string json, tmp;
    for(int i = 0; i < n; ++i)
    {
        getline(cin, tmp);
        json += tmp;
    }
    for(size_t i = 0; i < json.size();)
    {
        if(json[i] == ' ' || json[i] == '\n')
            json.erase(json.begin() + i);
        else ++i;
    }

    //address.postal  q[0] = "address" q[1] = "postal"
    vector<string> q;
    string word, query, result;
    size_t cur, rank;           //rank为json[cur]的层次数
    bool flag = 0;
    for(int i = 0; i < m; ++i)
    {
        //处理q
        flag = 0;
        q.clear();
        word.clear();
        result.clear();
        getline(cin, tmp);
        for(size_t i = 0; i < tmp.size(); ++i)
        {
            if(tmp[i] == '.')
            {
                q.push_back(word);
                word.clear();
            }
            else word += tmp[i];
        }
        q.push_back(word);

        //在json中查找query
        cur = rank = 0;
        for(size_t j = 0; j < q.size(); ++j)
        {
            query = sour(q[j]);
            for(; cur < json.size(); ++cur)
            {
                //如果当前rank<目标rank，直接no
                if(json[cur] == '{') ++rank;
                else if(json[cur] == '}') --rank;
                if(rank < j + 1) goto next;
                //如果找到了query
                if(rank == j + 1 && json.substr(cur, query.size()) == query)
                {
                    if(json[cur + query.size()] == '{') //value是OBJECT：若是最后一个键，直接输出OBJECT;否则，更新cur进行下一层
                    {
                        if(j == q.size() - 1)
                        {
                            cout << "OBJECT\n";
                            flag = 1;
                            goto next;
                        }
                        else
                        {
                            cur += query.size();
                            break;
                        }
                    }
                    else if(json[cur + query.size()] == '\"')   //value是字符串：如果是最后一个键，输出result；不是最后一个键，no
                    {
                        if(j == q.size() - 1)
                        {
                            for(cur += query.size() + 1; json[cur] != '}' && json[cur] != ','; ++cur)
                                result += json[cur];
                            result.erase(result.end() - 1);
                            cout << "STRING " << tran(result) << '\n';
                            flag = 1;
                        }
                        goto next;
                    }
                }
            }
        }
next:
        if(flag == 0) cout << "NOTEXIST\n";
    }
    return 0;
}