~每天进步一点点~

2015年7月24日

[leedcode 128] Longest Consecutive Sequence

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

posted @ 2015-07-24 21:54 ~每天进步一点点~ 阅读(145) 评论(0) 推荐(0) 编辑

[leedcode 126] Word Ladder

摘要： Given two words (beginWordandendWord), and a dictionary, find the length of shortest transformation sequence frombeginWordtoendWord, such that:Only on... 阅读全文

posted @ 2015-07-24 21:28 ~每天进步一点点~ 阅读(89) 评论(0) 推荐(0) 编辑

[leedcode 125] Valid Palindrome

摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文

posted @ 2015-07-24 20:35 ~每天进步一点点~ 阅读(139) 评论(0) 推荐(0) 编辑

[leedcode 124] 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 binary tree, 1 ... 阅读全文

posted @ 2015-07-24 20:24 ~每天进步一点点~ 阅读(97) 评论(0) 推荐(0) 编辑

[leedcode 123] Best Time to Buy and Sell Stock III

摘要： 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 @ 2015-07-24 19:11 ~每天进步一点点~ 阅读(132) 评论(0) 推荐(0) 编辑

2015年7月23日

[leedcode 122] Best Time to Buy and Sell Stock II

摘要： 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 @ 2015-07-23 23:45 ~每天进步一点点~ 阅读(95) 评论(0) 推荐(0) 编辑

[leedcode 121] Best Time to Buy and Sell Stock

摘要： Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文

posted @ 2015-07-23 23:35 ~每天进步一点点~ 阅读(115) 评论(0) 推荐(0) 编辑

2015年7月22日

[leedcode 120] 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 fol... 阅读全文

posted @ 2015-07-22 22:45 ~每天进步一点点~ 阅读(118) 评论(0) 推荐(0) 编辑

[leedcode 119] Pascal's Triangle II

摘要： Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].public class Solution { public List getRow(int ro... 阅读全文

posted @ 2015-07-22 22:18 ~每天进步一点点~ 阅读(127) 评论(0) 推荐(0) 编辑

[leedcode 118] Pascal's Triangle

摘要： GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文

posted @ 2015-07-22 21:58 ~每天进步一点点~ 阅读(114) 评论(0) 推荐(0) 编辑

公告