# 439. 三元表达式解析器

最新推荐文章于 2024-08-13 10:53:00 发布

sdlkjaljafdg

最新推荐文章于 2024-08-13 10:53:00 发布

阅读量269

点赞数

分类专栏： LeetCode刷题

本文链接：https://blog.csdn.net/Haku_yyf/article/details/120857082

版权

C语言三元表达式解析堆栈条件判断

关键词由CSDN通过智能技术生成

LeetCode刷题专栏收录该内容

124 篇文章 1 订阅

订阅专栏

char * parseTernary(char * expression){
    char *tmp = expression;
    int len = 0;
    while(*tmp != '\0')
    {
        tmp++;
        len++;
    }
    char *stack = (char *)malloc(sizeof(char) * 10000);
    memset(stack, 0, sizeof(char)*10000);
    int stackSize = 0;
    int i;
    for(i = len-1; i>=0; i--)
    {
        if(expression[i] <= '9' && expression[i] >= '0')
        {
            stack[stackSize++] = expression[i];
        }
        else if(expression[i] == 'T')
        {
            stack[stackSize++] = 'T';
        }
        else if(expression[i] == 'F')
        {
            stack[stackSize++] = 'F';
        }
        else if(expression[i] == '?')
        {
            char a = stack[--stackSize];
            char b = stack[--stackSize];
            if(expression[--i] == 'T') stack[stackSize++] = a;
            else stack[stackSize++] = b;
        }
    }
    assert (stackSize == 1);
    stack[stackSize] = '\0';
    return stack;
}