2014年05月_xiao囡囡

07月 06月 05月 04月 03月 02月 01月

原创 leetcode -day24 Maximum Depth of Binary Tree & Binary Tree Zigzag Level Order Traversal

1、Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.clas

2014-05-30 17:39:10 1203

原创 leetcode -day23 Construct Binary Tree from Inorder and Postorder Traversal & Construct Binary Tree f

1、Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in

2014-05-29 17:00:58 1696

原创 leetcode -day22 Binary Tree Level Order Traversal II & Convert Sorted Array to Binary Search Tree

1、Binary Tree Level Order Traversal IIGiven a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For e

2014-05-26 09:27:31 1086

原创 leetcode -day21 Longest Substring Without Repeating Characters

1、Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter

2014-05-22 21:54:59 1055

原创 leetcode -day20 Add Two Numbers

1、Add Two Numbers You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two num

2014-05-20 22:03:02 1195

原创 leetcode -day19 Convert Sorted List to Binary Search Tree

1、Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.分析：将一个升序排列的链表转换为平衡二叉搜索树，采用递归的方式，先找到链表

2014-05-19 13:22:03 1463 3

原创 leetcode -day18 Balanced Binary Tree

1、Balanced Binary TreeGiven 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 of the two subt

2014-05-18 21:39:15 1204

原创面试题整理19 矩阵Z字形扫描

题目：矩阵Z字形扫描对于

2014-05-17 09:35:00 3386

原创 leetcode -day17 Path Sum I II & Flatten Binary Tree to Linked List & Minimum Depth of Binary Tree

1、Path SumGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below

2014-05-17 09:33:25 1266

原创 leetcode -day16 ZigZag Conversion

1、ZigZag ConversionThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibili

2014-05-16 09:58:26 1476

转载小白鼠与毒药解题过程分析

网上流传着一题淘宝面试题，原题如下：我们有很多瓶无色的液体，其中有一瓶是毒药，其它都是蒸馏水，实验的小白鼠喝了以后会在5分钟后死亡，而喝到蒸馏水的小白鼠则一切正常。现在有5只小白鼠，请问一下，我们用这五只小白鼠，5分钟的时间，能够检测多少瓶液体的成分（）。A：5， B：6， C：31， D：32。+1只小白鼠首先可以想象只有1只小白鼠的情况，毫无疑问，1只小白鼠五分钟只能判

2014-05-14 18:57:14 1127

原创 leetcode -day 15 Distinct Subsequences

1、Distinct Subsequences Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original str

2014-05-14 10:42:19 1134 1

原创 leetcode -day14 Populating Next Right Pointers in Each Node I II

1、Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate

2014-05-13 11:03:48 924

原创 leetcode -day13 Valid Palindrome & Triangle & Pascal's Triangle I II

1、Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrom

2014-05-12 10:59:50 1041

原创 leetcode --day12 Surrounded Regions & Sum Root to Leaf Numbers & Longest Consecutive Sequence

1、Surrounded RegionsGiven a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For e

2014-05-11 17:08:26 1058

原创 leetcode -day11 Clone Graph & Palindrome Partitioning I II

1、Clone GraphClone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as

2014-05-08 22:18:57 1102

原创 leetcode -day10 Word Ladder I II

1、Word LadderGiven two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a tim

2014-05-07 15:19:36 1203

原创 leetcode -day9 Candy & Gas Station & Binary Tree Maximum Path Sum

1、CandyThere are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must h

2014-05-06 17:31:19 1039

原创 leetcode -day8 Copy List with Random Pointer & Single Number I II

五一中间断了几天，开始继续。。。1、Copy List with Random PointerA linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a

2014-05-05 14:21:12 1075