Introduction - If you have any usage issues, please Google them yourself
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)