2016年8月15日
Closest Binary Search Tree Value -- LeetCode
摘要： Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value is a floati 阅读全文
posted @ 2016-08-15 02:54 fenshen371 阅读(161) 评论(0) 推荐(0)
Palindrome Permutation -- LeetCode
摘要： Given a string, determine if a permutation of the string could form a palindrome. For example,"code" -> False, "aab" -> True, "carerac" -> True. 要点：学习 阅读全文
posted @ 2016-08-15 02:39 fenshen371 阅读(149) 评论(0) 推荐(0)
Logger Rate Limiter -- LeetCode
摘要： Design a logger system that receive stream of messages along with its timestamps, each message should be printed if and only if it is not printed in t 阅读全文
posted @ 2016-08-15 02:28 fenshen371 阅读(170) 评论(0) 推荐(0)