b.(10%) Given a string S which consist of space char and lower case letters (i.e.,', 'a', ...,'2), implement a function huffman_code (str) which can output the huffiman code table which is optimized to the input string S and convert the str into a bit pattem according to the generated hufiman code table.

1.(20%) Given a string c consist of"!" and "I" symbols, for every right parenthesis there exists a matching left parenthesis, we said that string is a balanced parentheses sequ quence. For example, are balanced parentheses sequence. On the other hand, are not balanced parentheses sequence. Plcase implement a function balanced_ parenthese (seq) which takes one string seq as the parameter. The function wil return true if the string seg is a balanced parentheses sequence or false otherwise.

題組內容

相關申論題

相關試卷