2015年5月6日
【leetcode】Balanced Binary Tree（middle）
摘要： Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth... 阅读全文
posted @ 2015-05-06 14:13 匡子语 阅读(212) 评论(0) 推荐(0)
【leetcode】Validate Binary Search Tree（middle）
摘要： Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n... 阅读全文
posted @ 2015-05-06 12:57 匡子语 阅读(232) 评论(0) 推荐(0)
【leetcode】Flatten Binary Tree to Linked List （middle）
摘要： Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2015-05-06 11:16 匡子语 阅读(204) 评论(0) 推荐(0)
【leetcode】Happy Number（easy）
摘要： Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer... 阅读全文
posted @ 2015-05-06 10:02 匡子语 阅读(310) 评论(0) 推荐(0)
【leetcode】Remove Linked List Elements（easy）
摘要： Remove all elements from a linked list of integers that have valueval.ExampleGiven:1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,val= 6Return:1 --> 2 --> 3 --... 阅读全文
posted @ 2015-05-06 09:55 匡子语 阅读(186) 评论(0) 推荐(0)
【leetcode】LRU Cache(hard)★
摘要： Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu... 阅读全文
posted @ 2015-05-06 09:52 匡子语 阅读(227) 评论(0) 推荐(0)