LeetCode - 随笔分类(第5页) - tenos

LeetCode:Binary Tree Inorder Traversal

摘要：题目链接Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].... 阅读全文

posted @ 2013-11-27 13:21 tenos 阅读(1667) 评论(0) 推荐(0) 编辑

LeetCode:Max Points on a Line

摘要：题目链接Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line.分析：首先要注意的是，输入数组中可能有重复的点。由于两点确定一条直线，一个很直观的解法是计算每两个... 阅读全文

posted @ 2013-11-26 20:45 tenos 阅读(10086) 评论(8) 推荐(3) 编辑

LeetCode:Word Ladder I II

摘要：其他LeetCode题目欢迎访问：LeetCode结题报告索引LeetCode:Word LadderGiven two words (startandend), and a dictionary, find the length of shortest transformation sequenc... 阅读全文

posted @ 2013-11-26 16:06 tenos 阅读(10690) 评论(5) 推荐(2) 编辑

LeetCode:Same Tree

摘要：题目链接Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identica... 阅读全文

posted @ 2013-11-24 23:58 tenos 阅读(806) 评论(0) 推荐(0) 编辑

LeetCode:Symmetric Tree

摘要：题目链接Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 /... 阅读全文

posted @ 2013-11-24 23:40 tenos 阅读(1327) 评论(0) 推荐(0) 编辑

LeetCode:Construct Binary Tree from Inorder and Postorder Traversal,Construct Binary Tree from Preorder and Inorder Traversal

摘要：LeetCode:Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You... 阅读全文

posted @ 2013-11-24 21:48 tenos 阅读(1481) 评论(2) 推荐(0) 编辑

LeetCode:Binary Tree Level Order Traversal I II

摘要：LeetCode:Binary Tree Level Order TraversalGiven a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by ... 阅读全文

posted @ 2013-11-24 21:37 tenos 阅读(3346) 评论(0) 推荐(0) 编辑

LeetCode:Binary Tree Zigzag Level Order Traversal

摘要：题目链接Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level an... 阅读全文

posted @ 2013-11-24 21:21 tenos 阅读(998) 评论(0) 推荐(0) 编辑

LeetCode:Convert Sorted Array to Binary Search Tree,Convert Sorted List to Binary Search Tree

摘要：LeetCode:Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST分析：... 阅读全文

posted @ 2013-11-24 15:30 tenos 阅读(1114) 评论(0) 推荐(1) 编辑

LeetCode:Balanced Binary Tree

摘要：题目链接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 d... 阅读全文

posted @ 2013-11-24 15:21 tenos 阅读(607) 评论(0) 推荐(0) 编辑

LeetCode:Minimum Depth of Binary Tree,Maximum Depth of Binary Tree

摘要：LeetCode:Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from... 阅读全文

posted @ 2013-11-24 15:17 tenos 阅读(2948) 评论(2) 推荐(0) 编辑

LeetCode:Path Sum I II

摘要：LeetCode: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... 阅读全文

posted @ 2013-11-24 15:06 tenos 阅读(1753) 评论(0) 推荐(0) 编辑

LeetCode:Flatten Binary Tree to Linked List

摘要：题目链接Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flatten... 阅读全文

posted @ 2013-11-24 14:57 tenos 阅读(574) 评论(0) 推荐(0) 编辑

LeetCode:Distinct Subsequences

摘要：我的LeetCode解题报告索引题目链接Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is ... 阅读全文

posted @ 2013-11-24 14:50 tenos 阅读(2667) 评论(1) 推荐(1) 编辑

LeetCode:Populating Next Right Pointers in Each Node I II

摘要：LeetCode:Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; ... 阅读全文

posted @ 2013-11-22 14:24 tenos 阅读(1001) 评论(0) 推荐(0) 编辑

LeetCode:Pascal's Triangle I II

摘要：LeetCode:Pascal's TriangleGivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1... 阅读全文

posted @ 2013-11-21 22:47 tenos 阅读(887) 评论(0) 推荐(0) 编辑

LeetCode:Triangle

摘要：题目链接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 example, given the... 阅读全文

posted @ 2013-11-21 22:37 tenos 阅读(1745) 评论(0) 推荐(0) 编辑

LeetCode:Best Time to Buy and Sell Stock I II III

摘要：LeetCode:Best Time to Buy and Sell StockSay you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted... 阅读全文

posted @ 2013-11-21 22:02 tenos 阅读(11555) 评论(5) 推荐(4) 编辑

LeetCode:Binary Tree Maximum Path Sum

摘要：题目如下：二叉树的最大路径和（题目链接）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 bin... 阅读全文

posted @ 2013-11-21 13:15 tenos 阅读(802) 评论(0) 推荐(0) 编辑

LeetCode 解题报告索引

摘要：最近在准备找工作的算法题，刷刷LeetCode，以下是我的解题报告索引，每一题几乎都有详细的说明，供各位码农参考。根据我自己做的进度持续更新中...... 本文地址LeetCode:Reverse Words in a StringLeetCode:Evaluate Reverse Polish N... 阅读全文

posted @ 2013-11-20 23:09 tenos 阅读(9978) 评论(0) 推荐(0) 编辑

JustDoIT

LIVE FOR CODING

随笔分类 - LeetCode

公告