假设一个算术表达式中可包含如下符号：“（）”、“[]”、“{}”、 “/* */”可按任务次序嵌套使用，试利用栈的运算编写判别表达式中符号是否正确配对出现的算法-Assume that an arithmetic expression can contain the following symbols: () " "　[] " ,"　{} " ,"　/**/" task order can be nested test prepared by the operator of the stack to distinguish expression symbols correctly paired appear algorithm