摘要: Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both sand t. t is pot 阅读全文
posted @ 2019-01-09 17:41 fatttcat 阅读(145) 评论(0) 推荐(0) 编辑
摘要: Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia:In a complete binary tree every lev 阅读全文
posted @ 2019-01-09 05:49 fatttcat 阅读(97) 评论(0) 推荐(0) 编辑