算法设计五章习题答案（Algorithm design five chapter answer）.docVIP

算法设计五章习题答案（Algorithm design five chapter answer） Algorithm design and analysis (second edition) problem answer (chapter 5) Chief editor: lv guoying The solutions The fifth chapter 1. # include stdio, h # include stdlib. H # include string. H Struct s_node { Char data; Struct s_node * next; }; Typedef struct s_node s_list; Typedef s_list * link; The link stack = NULL; Void print_stack () { The link temp = NULL; Temp = stack; If (temp = = NULL) Printf ( The stack is empty!!!!! \ n ); The else { While (temp! = NULL) / / means that if temp = NULL, it will not circulate { Printf ( [% d] , temp - data); Temp = temp - next; } Printf ( \ n ); } } Int utilities like is_empty that () { If (stack = = NULL) Return 1; The else Return 0; } Void push (char value) { The link newnode; / / printf ( \ nThe stack content before (top) - bottom: ); / / print_stack (); Newnode = (link) malloc (sizeof (s_list)); Newnode - data = value; Newnode - next = stack; Stack = newnode; } Int the pop () { The link top; Int temp. / / printf ( \ nThe stack content before (top) - bottom: ); / / print_stack (); If (stack! = NULL) { Top = stack; Stack = stack - next; Temp = top - data; Free (top); Return temp. } The else The return - 1; } Int is_op (char ch) { If (ch = = + | | ch = = - | | ch = = * | | ch = = /) Return 1; The else Return 0; } Int is_num (char ch) { If (ch = 9 ch = 0) Return 1; Return 0; } Void test (char * buf) { Int len. Int I; Len = strlen (buf); For (I = 0; I len; i++) { If (buf [I] = = () { If (buf [I + 1) = = ) ) { Printf ( invalid expression \ n ); Break; } The else Push (buf [I]); } If (is_op (buf [I])) { If (buf [I + 1) = = ) ) { Printf ( invalid expression \ n ); Break; } } If (is_num (buf [I])) { If (buf [I + 1) = = () { Printf ( invalid expression \ n ); Break; } } If (buf [I] = = ) ) { If (pop () = = 1) { Printf ( invalid expression \ n ); Break; } } } If (utilities like is_empty that ()) { Printf ( correct expression \ n ); } The else Printf ( invalid expres