#772基本计算器III

最新推荐文章于 2022-06-08 16:53:41 发布

sdlkjaljafdg

最新推荐文章于 2022-06-08 16:53:41 发布

阅读量200

点赞数

分类专栏： LeetCode刷题文章标签：数据结构算法

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

版权

LeetCode刷题专栏收录该内容

124 篇文章 1 订阅

订阅专栏

一：考虑括号，超时解法：

void Trans(char *infix, char **postfix, int *postfixIndex)
{
    char **stack = (char **)malloc(sizeof(char *) * 300000);
    memset(stack, 0, sizeof(char *) * 300000);
    int stackSize = 0;
    for(stackSize = 0; stackSize < 300000; stackSize++)
    {
        stack[stackSize] = (char *)malloc(sizeof(char)*2);
        memset(stack[stackSize], 0, sizeof(char)*2);
    }
    stackSize = 0;
    *postfixIndex = 0;
    int i;
    for(i = 0; infix[i] != '\0'; ++i)
    {
        if(infix[i] == ' ') continue;
        else if(infix[i] <= '9' && infix[i] >= '0')
        {
            char *tmp = (char *)malloc(sizeof(char) * 11);
            memset(tmp, 0, sizeof(char) * 11);
            int j = 0;
            while(infix[i] != '\0' && infix[i] <= '9' && infix[i] >= '0')
            {
                tmp[j++] = infix[i++];
            }
            postfix[(*postfixIndex)++] = tmp;
            i--;
        }
        else if(infix[i] == '+' || infix[i] == '-')
        {
            if(stackSize==0)
            {
                stack[stackSize++][0] = infix[i];
            }
            else
            {
                while(stackSize > 0 && stack[stackSize-1][0] != '(')
                {
                    memcpy(postfix[(*postfixIndex)++], stack[--stackSize], sizeof(char) * 2);
                }
                stack[stackSize++][0] = infix[i];
            }
        }
        else if(infix[i] == '*' || infix[i] == '/')
        {
            if(stackSize==0) stack[stackSize++][0] = infix[i];
            else
            {
                --stackSize;
                while(stackSize >= 0 && \
                     stack[stackSize][0] != '(' && \
                     (stack[stackSize][0] == '*' || stack[stackSize][0] == '/'))
                {
                    memcpy(postfix[(*postfixIndex)++], stack[stackSize--], sizeof(char) *2);
                }                
                stack[++stackSize][0] = infix[i];
                stackSize++;
            }
        }
        else if(infix[i] == '(')
        {
            stack[stackSize++][0] = infix[i];
        }
        else if(infix[i] == ')')
        {
            while(stackSize > 0 && stack[--stackSize][0] != '(')
            {
                memcpy(postfix[(*postfixIndex)++], stack[stackSize], sizeof(char) * 2);
            }
        }
        else
        {
            break;
        }
    }
    while(stackSize > 0)
    {
        memcpy(postfix[(*postfixIndex)++],stack[--stackSize], sizeof(char)*2);
    }
}

int evalRPN(char ** tokens, int tokensSize){
    int i;
    int *stack = (int *)malloc(sizeof(int) * tokensSize);
    memset(stack, 0, sizeof(int) * tokensSize);
    int index = 0;
    int result = 0;
    for(i = 0; i<tokensSize; i++)
    {
        if(0==strcmp(tokens[i], "+"))
        {
            int first =  stack[--index];
            if(index==0) stack[index++] = first;
            else
            {
                int two = stack[--index];
                stack[index++] = two + first;
            }
        }
        else if(0==strcmp(tokens[i], "-"))
        {
            int first =  stack[--index];
            if(index == 0) 
            {
                stack[index++] = -1 * first;
            }
            else
            {   int two = stack[--index];
                stack[index++] = two - first;
            }
        }
        else if(0==strcmp(tokens[i], "*"))
        {
            int first =  stack[--index];
            int two = stack[--index];
            stack[index++] = two * first;
        }
        else if(0==strcmp(tokens[i], "/"))
        {
            int first =  stack[--index];
            int two = stack[--index];
            stack[index++] = two / first;
        }
        else
        {
            stack[index++] = atoi(tokens[i]);
        }
    }
    result = stack[0];
    free(stack);
    return result;
}

int calculate(char * s){
    char **post = (char **)malloc(sizeof(char *) * 300000);
    int i;
    for(i = 0; i<300000; i++)
    {
        post[i] = (char *)malloc(sizeof(char) * 11);
        memset(post[i], 0, sizeof(char) * 11);
    }
    int length = 0;
    Trans(s, post, &length);
    return evalRPN(post, length);
}