码迷,mamicode.com
首页 >  
搜索关键字:may cause a leak    ( 6377个结果
[LeetCode] Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.方法一:最先想到的就是递归,注...
分类:其他好文   时间:2014-07-10 09:58:40    阅读次数:224
[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.方法:在inorder中寻找...
分类:其他好文   时间:2014-07-07 23:18:53    阅读次数:283
Problem Binary Tree Maximum Path Sum
Problem Description:Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below bina...
分类:其他好文   时间:2014-07-07 15:57:05    阅读次数:252
Problem Triangle
Problem Description:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For ex...
分类:其他好文   时间:2014-07-07 15:29:11    阅读次数:280
Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express...
分类:其他好文   时间:2014-06-30 23:46:14    阅读次数:288
Problem Evaluate Reverse Polish Notation
Problem Description:Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integ...
分类:其他好文   时间:2014-06-30 14:32:54    阅读次数:151
LeetCode:Longest Palindromic Substring
Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there...
分类:其他好文   时间:2014-06-30 13:21:00    阅读次数:202
【LeetCode】ZigZag Conversion
题目 The 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 legibility) P A H N A...
分类:其他好文   时间:2014-06-30 00:07:36    阅读次数:268
Scramble String
题目 Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great /...
分类:其他好文   时间:2014-06-29 23:16:19    阅读次数:312
leetcode--Longest Palindromic Substring
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类:其他好文   时间:2014-06-29 20:28:58    阅读次数:183
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!