[레벨 1] 다트찾기

#include <string>
#include <vector>
#include <cmath>
using namespace std;
int solution(string dartResult) {
    int answer = 0;
    
    int len = dartResult.size();
    vector<int> ret;
    ret.reserve(len);
    int retIndex = -1;
    for (int i = 0; i < len; ++i)
    {
        if (dartResult[i] >= '0' && dartResult[i] <= '9')
        {
            ++retIndex;
            if (dartResult[i] == '1' && dartResult[i + 1] == '0')
            {
                ret.push_back(10);
                ++i;
                continue;
            }
            ret.push_back(dartResult[i] - '0');
        }
        else if (dartResult[i] == 'S')
            ret[retIndex] = pow(ret[retIndex], 1);
        else if (dartResult[i] == 'D')
            ret[retIndex] = pow(ret[retIndex], 2);
        else if (dartResult[i] == 'T')
            ret[retIndex] = pow(ret[retIndex], 3);
        else if (dartResult[i] == '*')
        {
            if (ret.size() == 1) // 처음나온경우.
            {
                ret[retIndex] *= 2;
                continue;
            }
            ret[retIndex - 1] *= 2;
            ret[retIndex] *= 2;
        }
        else if (dartResult[i] == '#')
            ret[retIndex] *= -1;
    }
    for (int i = 0; i < ret.size(); ++i)
        answer += ret[i];

    return answer;
}