数据结构课后设计题第三章



◆3.17③ 试写一个算法，识别依次读入的一个以@

为结束符的字符序列是否为形如 序列1&序列2 模式

的字符序列。其中序列1和序列2中都不含字符 & ，

且序列2是序列1的逆序列。例如， a+b&b+a 是属该

模式的字符序列，而 1+3&3-1 则不是。



实现下列函数:

Status match(char *str) -Data structure design question after class Chapter ◆ 3.17 ③ try to write an algorithm to identify sequence read of a character @ as the terminator sequence is the form such as ' sequence 1 &　Series 2'　mode of character sequence. In which the sequence 1 and sequence 2 are without character ' & ' , and the sequence is the sequence 1, 2, reverse sequence. For example, ' a+ b &　b+ a'　is the character sequence is the model, while the ' 1+ 3 &　3-1 ' is not. To achieve the following functions: Status match (char* str)