峰子_仰望阳光

2015年6月12日

LeetCode之“动态规划”：Valid Parentheses && Longest Valid Parentheses

摘要： 1.Valid Parentheses 题目链接题目要求： Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid. T... 阅读全文

posted @ 2015-06-12 23:14 峰子_仰望阳光阅读(628) 评论(0) 推荐(0)

LeetCode之“动态规划”：Interleaving String

摘要：题目链接题目要求： Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2. For example, Given: s1="aabcc", s2="dbbca", Whens3="aadbbcb... 阅读全文

posted @ 2015-06-12 16:13 峰子_仰望阳光阅读(340) 评论(0) 推荐(0)

LeetCode之“动态规划”：Maximum Product Subarray

摘要：题目链接题目要求： Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the ar... 阅读全文

posted @ 2015-06-12 10:48 峰子_仰望阳光阅读(331) 评论(0) 推荐(0)

2015年6月11日

LeetCode之“动态规划”：Decode Ways

摘要：题目链接题目要求： A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26 Given an enco... 阅读全文

posted @ 2015-06-11 23:03 峰子_仰望阳光阅读(329) 评论(0) 推荐(0)

LeetCode之“动态规划”：Maximum Subarray

摘要：题目链接题目要求： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array[... 阅读全文

posted @ 2015-06-11 20:33 峰子_仰望阳光阅读(641) 评论(0) 推荐(0)

LeetCode之“动态规划”：Best Time to Buy and Sell Stock I && II && III && IV

摘要： Best Time to Buy and Sell Stock I 题目链接题目要求： Say you have an array for which theithelement is the price of a given stock on dayi. If you were only... 阅读全文

posted @ 2015-06-11 17:00 峰子_仰望阳光阅读(629) 评论(0) 推荐(0)

2015年6月10日

LeetCode之“动态规划”：Word Break && Word Break II

摘要： 1. Word Break 题目链接题目要求： Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or mor... 阅读全文

posted @ 2015-06-10 16:08 峰子_仰望阳光阅读(715) 评论(0) 推荐(0)

2015年6月9日

LeetCode之“动态规划”：Maximal Square && Largest Rectangle in Histogram && Maximal Rectangle

摘要： 1.Maximal Square 题目链接题目要求： Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area. F... 阅读全文

posted @ 2015-06-09 19:39 峰子_仰望阳光阅读(1259) 评论(0) 推荐(0)

LeetCode之“动态规划”：Climbing Stairs

摘要：题目链接题目要求 You are climbing a stair case. It takesnsteps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct wa... 阅读全文

posted @ 2015-06-09 17:07 峰子_仰望阳光阅读(407) 评论(0) 推荐(0)

LeetCode之“动态规划”：House Robber && House Robber II

摘要： House Robber题目链接 House Robber II题目链接 1.House Robber 题目要求: You are a professional robber planning to rob houses along a street. Each house has a ... 阅读全文

posted @ 2015-06-09 15:02 峰子_仰望阳光阅读(445) 评论(0) 推荐(0)

峰子_仰望阳光

公告