2015年1月3日
【leetcode】Longest Valid Parentheses
摘要： Longest Valid ParenthesesGiven a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substr... 阅读全文
posted @ 2015-01-03 21:04 H5开发技术 阅读(134) 评论(0) 推荐(0)
【leetcode】Word Search
摘要： Word SearchGiven a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, wh... 阅读全文
posted @ 2015-01-03 19:31 H5开发技术 阅读(173) 评论(0) 推荐(0)
【leetcode】Integer to Roman
摘要： Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.罗马数字的组数规则,有几条须注意掌握；(1)基本数字Ⅰ、... 阅读全文
posted @ 2015-01-03 17:11 H5开发技术 阅读(172) 评论(0) 推荐(0)
【leetcode】First Missing Positive
摘要： First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Yo... 阅读全文
posted @ 2015-01-03 16:35 H5开发技术 阅读(134) 评论(0) 推荐(0)
【leetcode】Edit Distance
摘要： Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You... 阅读全文
posted @ 2015-01-03 16:06 H5开发技术 阅读(198) 评论(0) 推荐(0)
【leetcode】Container With Most Water
摘要： Container With Most WaterGivennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such t... 阅读全文
posted @ 2015-01-03 15:05 H5开发技术 阅读(145) 评论(0) 推荐(0)
【leetcode】Reverse Linked List II
摘要： Reverse Linked List IIReverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return... 阅读全文
posted @ 2015-01-03 12:19 H5开发技术 阅读(164) 评论(0) 推荐(0)
【leetcode】Path Sum II
摘要： Path Sum IIGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tr... 阅读全文
posted @ 2015-01-03 11:37 H5开发技术 阅读(155) 评论(0) 推荐(0)
【leetcode】Binary Tree Maximum Path Sum
摘要： Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the be... 阅读全文
posted @ 2015-01-03 11:20 H5开发技术 阅读(136) 评论(0) 推荐(0)
【leetcode】Restore IP Addresses
摘要： Restore IP AddressesGiven a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"255255... 阅读全文
posted @ 2015-01-03 10:52 H5开发技术 阅读(182) 评论(0) 推荐(0)