摘要：
Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2014-11-29 23:29
Jessica程序猿
阅读(375)
评论(0)
推荐(0)
摘要：
Dynamic ProgrammingGivens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", r... 阅读全文
posted @ 2014-11-29 21:38
Jessica程序猿
阅读(213)
评论(0)
推荐(0)
摘要：
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 ... 阅读全文
posted @ 2014-11-29 20:33
Jessica程序猿
阅读(286)
评论(0)
推荐(0)
摘要：
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... 阅读全文
posted @ 2014-11-29 19:07
Jessica程序猿
阅读(242)
评论(0)
推荐(0)
摘要：
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.参考：http://xpentium.blog.163.com/b... 阅读全文
posted @ 2014-11-29 16:20
Jessica程序猿
阅读(218)
评论(0)
推荐(0)
摘要：
Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histog... 阅读全文
posted @ 2014-11-29 14:39
Jessica程序猿
阅读(156)
评论(0)
推荐(0)
摘要：
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-11-29 11:55
Jessica程序猿
阅读(177)
评论(0)
推荐(0)
摘要：
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2014-11-29 10:38
Jessica程序猿
阅读(271)
评论(0)
推荐(0)
摘要：
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2014-11-29 10:11
Jessica程序猿
阅读(192)
评论(0)
推荐(0)
浙公网安备 33010602011771号