上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 23 下一页
摘要: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. 阅读全文
posted @ 2014-07-06 22:43 jdflyfly 阅读(146) 评论(0) 推荐(0) 编辑
摘要: Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end 阅读全文
posted @ 2014-07-05 00:26 jdflyfly 阅读(227) 评论(0) 推荐(0) 编辑
摘要: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: 阅读全文
posted @ 2014-07-03 22:50 jdflyfly 阅读(178) 评论(0) 推荐(0) 编辑
摘要: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. 阅读全文
posted @ 2014-07-03 22:19 jdflyfly 阅读(157) 评论(0) 推荐(0) 编辑
摘要: ay you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. 阅读全文
posted @ 2014-07-03 22:15 jdflyfly 阅读(144) 评论(0) 推荐(0) 编辑
摘要: Say you have an array for which the ith element is the price of a given stock on day i. 阅读全文
posted @ 2014-07-03 21:59 jdflyfly 阅读(139) 评论(0) 推荐(0) 编辑
摘要: ay you have an array for which the ith element is the price of a given stock on day i. 阅读全文
posted @ 2014-07-03 21:53 jdflyfly 阅读(207) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, find the maximum path sum. 阅读全文
posted @ 2014-07-03 21:42 jdflyfly 阅读(155) 评论(0) 推荐(0) 编辑
摘要: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. 阅读全文
posted @ 2014-07-03 21:30 jdflyfly 阅读(146) 评论(0) 推荐(0) 编辑
摘要: Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution still work? 阅读全文
posted @ 2014-07-03 21:17 jdflyfly 阅读(225) 评论(3) 推荐(0) 编辑
上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 23 下一页