摘要: Closest Binary Search Tree Value Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Not 阅读全文
posted @ 2016-10-18 11:24 北叶青藤 阅读(226) 评论(0) 推荐(0) 编辑
摘要: An abbreviation of a word follows the form <first letter><number><last letter>. Below are some examples of word abbreviations: Assume you have a dicti 阅读全文
posted @ 2016-10-18 10:41 北叶青藤 阅读(202) 评论(0) 推荐(0) 编辑