#define _CRT_SECURE_NO_DEPRECATE

#define _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES 1

#include <stdlib.h>
#include <stdio.h>
#include "myStack.h"

// 判斷是否操作符
int ifOp(char c) {
    switch (c) {
    case '+':
        return 1;
    case '-':
        return 1;
    case '*':
        return 1;
    case '/':
        return 1;
    case '(':
        return 1;
    case ')':
        return 1;
    case '#':
        return 1;
    default:
        break;
    }
    return 0;
}

int findOffset(char * str,char c,int len) {
    for (int i = 0; i < len;i++) {
        if (str[i] == c) {
            return i;
        }
    }
    return -1;
}

//判斷任意相繼出現(xiàn)的2個(gè)運(yùn)算符的優(yōu)先級(jí)
char yxji(char op1,char op2) {
    char ops[] = "+-*/()#";
    char oplist[7][7] = { 
        ">><<<>>",
        ">><<<>>",
        ">>>><>>",
        ">>>><>>" ,
        "<<<<<=&",
        ">>>>&>>",
        "<<<<<&="};
    int len = sizeof(ops) / sizeof(char);
    return oplist[findOffset(ops,op1, len)][findOffset(ops, op2, len)];
}

//基礎(chǔ)運(yùn)算 a-第1個(gè)數(shù)  b-第2個(gè)數(shù)
void baseOp(char op,int a,int b,int * value) {
    printf("baseOp %d %c %d",a,op,b);
    //int value = 0;
    //int* p = &value;
    switch (op) {
    case '+':
        *value = a + b;
        break;
    case '-':
        *value = a-b;
        break;
    case '*':
        *value = a*b;
        break;
    case '/':
        *value = a/b;
        break;
    default:
        printf("運(yùn)算符不合法");
        exit(1);
    }
}

//轉(zhuǎn)換字符為數(shù)字
void transValue(char  c,int * v) {
    if (c > 47 && c < 58) {
        *v =  (c - 48);
    }
}

void printstack(MyStack * stack1,MyStack * stack2) {
    int len1 = myListGetSize(stack1);
    int len2 = myListGetSize(stack2);
    printf("stack1值：");
    for (int i = 0; i < len1;i++) {
        char* m = (char*)myListGetDataAt(stack1,i );
        printf("%c ", *m);
    }
    printf("\nstack2值：");
    for (int i = 0; i < len2; i++) {
        int* m = (int*)myListGetDataAt(stack2, i);
        printf("%d(%p) ", *m,m);
    }
    printf("\n");
}

// 計(jì)算,該方法只能對(duì)數(shù)字 0-9 運(yùn)算(可掌握棧、指針的使用)
// 2*3*(1+2)#
void calculate(char bds[]) {
    int i = 0;
    char flag = '#';
    MyStack* stack1 = createMyStack();//stack1中放運(yùn)算符
    myStackPush(stack1, &flag);
    MyStack* stack2 = createMyStack();//stack2中放數(shù)字
    //char c = bds[i]; // 等價(jià)于*(bds+i) 
    while (bds[i] != '#' || *(char*)myStackGetTop(stack1)!='#') {
        printstack(stack1,stack2);
        if (!ifOp(bds[i])) {
             /*
             *  這種寫(xiě)法不行!
                 int vv = 0;
                 transValue(bds[i], &vv)
             */
            int* vu = (int*)malloc(sizeof(int));
            transValue(bds[i], vu);
            printf("is number:%d\n", *vu);//打印出數(shù)字
            myStackPush(stack2, vu);
            i++;
        }
        else {
            printf("is fuhao:%c\n", bds[i]);
            char * op1 = (char*)myStackGetTop(stack1);
            printf("top1 op:%c\n",*op1);
            if (*op1 == '#') {
                myStackPush(stack1, &bds[i]);
                i++;
                continue;
            }
            char res = yxji(*op1, bds[i]);
            printf("yxji:%c\n",res);
            switch (res) {
                case '>':{
                    char* curop = (char*)myStackPop(stack1);//取出當(dāng)前運(yùn)算符
                    printf("top2 op:%c\n", *op1);
                    int* b = (int*)myStackPop(stack2);//第2個(gè)運(yùn)算數(shù)
                    int* a = (int*)myStackPop(stack2);//第1個(gè)運(yùn)算數(shù)
                    /*
                    *  這種寫(xiě)法不行! 
                        int value = 0;
                        baseOp(*curop,transValue(*a), transValue(*b),&value);
                    */
                    int* value = (int*)malloc(sizeof(int));
                    baseOp(*curop, *a, *b, value);
                    printf("=%d\n", *value);
                    myStackPush(stack2, value);
                    break;
                }
                case '<':
                    myStackPush(stack1, &bds[i]);
                    i++;
                    break;
                case '=': {
                    printf("()==");
                    myStackPop(stack1);//取出右括號(hào) (
                    i++;
                    break;
                }
                default:
                    printf("表達(dá)式錯(cuò)誤!");
                    exit(1);
            }
        }
    }
    int * valueRes = (int*)myStackPop(stack2);
    printf("計(jì)算結(jié)果值為:%d\n",*valueRes);

    freeMyList(stack1);
    freeMyList(stack2);
}

int main() {
    printf("輸入表達(dá)式：\n");
    char bds[50];
    scanf("%s",bds);// 數(shù)組變量名，傳入的相當(dāng)于是數(shù)組第一個(gè)元素的地址。方法形參是個(gè)指針變量，指針變量才能存放地址
    calculate(bds);
    return 0;
}