Search - algorithm parentheses and brackets

Search - algorithm parentheses and brackets - List

[Data structs] 3 DL : 0: 假设一个算术表达式中可以包含三种括号：圆括号，方括号和花括号，且这三种括号可按照任意的次序嵌套使用，编写判别给定表达式中所含括号是否正确配对出现的算法（已知表达式已存入数据元素部位字符的顺序表中）-Suppose an arithmetic expression can include three kinds of brackets: parentheses, square brackets and curly braces, and the three brackets can be used in accordance with any order of nesting, the preparation of discrimination contained in the given expression correctly matches appear in parentheses algorithm (known expression data elements have been deposited in parts of the order of characters in the table)
Date : 2025-12-29 Size : 1kb User : 吴立国
[Data structs] ok DL : 0: 顺序表的应用（1）已知长度为n的线性表A采用顺序存储结构，请写一时间复杂度为0(n)、空间复杂度为0(1)的算法，该算法删除线性表中所有值为item的数据元素。要求：线性表元素个数n很大，而值为item的数据元素个数很少，要求移动元素个数尽量少；删除后的数组元素与原数组元素不必保持顺序一致。（2）编写一个函数将一个顺序表A（有n个元素，且任何元素均不为0）分拆成两个顺序表，使A中大于0的元素存放在B中，小于0的元素存放在C中。（3）假设一个算术表达式中包含圆括号，方括号和花号三种类型的括号，编写一个判别表达式中括号是否正确配对的函数correct（exp，tag）；其中：exp为字符串类型量，表示被判别的表达式，tag为布尔型的变量。（4）编写向顺序分配的循环队列QU[0,m-1]中插入一个结点的函数enqueue和从该队列中取出一个节点的dequeue函数。（5）编写一个主函数,调试上述算法。 -The application of the order form (1) of length n given in Table A using the linear sequence of storage structure, please write a time complexity 0 (n), space complexity is 0 (1) of the algorithm to delete all the values of the linear form for the item of data elements. Requirements: n number of elements in a large linear table, while the number of data elements is very little item, requiring as little as possible the number of mobile elements to delete array element after the array elements do not have to maintain the original order of the same. (2) write a function to a sequence of Table A (with n elements, and any element not 0) the order split into two tables, so that A is greater than 0 in the element is stored in B, is less than 0 elements stored in C. (3) assuming an arithmetic expression contains parentheses, brackets, and three types of flower number in parentheses, the expression in parentheses write a discriminant function correctly matching correct (exp
Date : 2025-12-29 Size : 2kb User : jay
[Data structs] parentheses-design DL : 0: 假设一个算数表达式中可包含三种括号：圆括号，方括号和花括号且这三种括号可以按任意次序嵌套使用。试利用栈的运算，编写判别表达式中所含括号是否正确配对出现的算法-Suppose an arithmetic expression can contain three brackets: parentheses, brackets and braces and three brackets can be nested in any order. The trial use of the computing stack, the preparation of the algorithm is correct pairing of the discriminant expression contained in parentheses appear
Date : 2025-12-29 Size : 2kb User : 陈磊
[Data structs] bracelet-matching DL : 0: 关于算式中小括号、中括号和花括号的匹配检查算法-Match checking algorithm on small formula parentheses, brackets and braces
Date : 2025-12-29 Size : 1kb User : 林仲懿
[Data structs] zhan DL : 0: 栈假设一个算术表达式中可以包含三种括号：园括号“(”和“)”、方括号“[”和“]”、花括号“{”和“}”，且这三种括号可按任意的次序嵌套使用。编写判别给定表达式中所含括号是否正确配对出现的算法（已知表达式已存入数据元素为字符的顺序表中）。要求：顺序栈存储；实现顺序栈的基本操作；调用基本操作完成。-The stack Suppose a arithmetic expressions can contain three kind of parentheses: garden \ (\ and\ ) \ , brackets, brackets \ [\ and\ ] \ , curly braces \ {\ and\ } \ , and the three brackets can be used according to the sequence of arbitrary nested. Write discriminant given expression in parentheses is properly matched the algorithm (known expression has been deposited in the data elements for the character sequence in the table). Requirements: order stack storage To realize the basic operations of stack order Call the basic operation is completed.
Date : 2025-12-29 Size : 6kb User : huangyinghao