2017年1月24日
Leetcode 333. Largest BST Subtree
摘要： Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. Not 阅读全文
posted @ 2017-01-24 14:52 lettuan 阅读(175) 评论(0) 推荐(0)
Leetcode 3. Longest Substring without repeating characters
摘要： Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
posted @ 2017-01-24 13:08 lettuan 阅读(133) 评论(0) 推荐(0)