摘要: Example : Infix : (A+B) * (C-D) ) Postfix: AB+CD-* 算法: 1. Scan the infix expression from left to right. 2. If the scanned character is an operand, app 阅读全文
posted @ 2019-07-22 13:40 北叶青藤 阅读(321) 评论(0) 推荐(0) 编辑
摘要: Given a list of strings, output the most frequent characters that are in the same group as the letter. For example, for string "abc", a, b,c are in th 阅读全文
posted @ 2019-07-22 13:02 北叶青藤 阅读(351) 评论(0) 推荐(0) 编辑