leetcode
文章平均质量分 78
娜娜酱
这个作者很懒,什么都没留下…
展开
-
Binary Tree Maximum Path Sum----leetcode
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 binary tree, 1 / \ 2 3Return 6.原创 2014-05-05 15:41:49 · 418 阅读 · 0 评论 -
Word Break----leetcode
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"原创 2014-05-05 17:52:26 · 452 阅读 · 0 评论 -
Surrounded Regions----leetcode
Given 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 example,原创 2014-05-05 15:24:02 · 489 阅读 · 0 评论 -
Valid Palindrome----leetcode
Given 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 palindrome."race a car" is not a原创 2014-05-05 15:31:09 · 432 阅读 · 0 评论 -
Word Ladder----leetcode
Given 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 timeEach intermediate word m原创 2014-05-05 15:50:35 · 475 阅读 · 0 评论 -
Longest Consecutive Sequence ----leetcode
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3原创 2014-05-05 16:03:26 · 467 阅读 · 0 评论