Review->Improve - 博客园

2017年8月29日

[Coding Made Simple] Buy/Sell stock with at most K transactions to maximize profit

摘要： Given an array of length n that stores a stock's price in n consecutive days, Buy/Sell stock with at most K transactions to maximize profit. You must 阅读全文

posted @ 2017-08-29 13:45 Review->Improve 阅读(432) 评论(0) 推荐(0)

[LeetCode 10] Regular Expression Matching

摘要： Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding elemen 阅读全文

posted @ 2017-08-29 13:35 Review->Improve 阅读(350) 评论(0) 推荐(0)

[LeetCode 44] Wildcard Matching

摘要： Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (including 阅读全文

posted @ 2017-08-29 10:47 Review->Improve 阅读(254) 评论(0) 推荐(0)

2017年8月28日

[Coding Made Simple] Regular Expression

摘要： Same Problem Link. [LintCode] Regular Expression Matching 阅读全文

posted @ 2017-08-28 09:29 Review->Improve 阅读(134) 评论(0) 推荐(0)

[Coding Made Simple] Wildcard Matching

摘要： Same Problem Link. [LintCode] Wildcard Matching 阅读全文

posted @ 2017-08-28 09:28 Review->Improve 阅读(95) 评论(0) 推荐(0)

[LeetCode 312] Burst Balloons

摘要： Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloon 阅读全文

posted @ 2017-08-28 09:09 Review->Improve 阅读(460) 评论(0) 推荐(0)

[Coding Made Simple] Optimal Strategy Game Pick from Ends of array

摘要： N pots, each with some number of gold coins, are arranged in a line. You are playing a game against another player. You take turns picking a pot of go 阅读全文

posted @ 2017-08-28 05:14 Review->Improve 阅读(878) 评论(0) 推荐(0)

2017年8月26日

[LintCode] Palindrome Partitioning II

摘要： Given a string s, cut s into some substrings such that every substring is a palindrome. Return the minimum cuts needed for a palindrome partitioning o 阅读全文

posted @ 2017-08-26 11:20 Review->Improve 阅读(435) 评论(0) 推荐(0)

[Coding Made Simple] Word Break Problem

摘要： Given a string and a dictionary, return true if the string can be split into multiple words such that each word is in dictionary. If not return false. 阅读全文

posted @ 2017-08-26 07:19 Review->Improve 阅读(152) 评论(0) 推荐(0)

[Coding Made Simple] Minimum Cost Path

摘要： Given a 2 dimensional matrix, find minimum cost path to reach bottom right from top left provided you can only from down and right. For a 5 * 5 matrix 阅读全文

posted @ 2017-08-26 06:47 Review->Improve 阅读(229) 评论(0) 推荐(0)

Push your limit!

Tell me and I will forget. Show me and I will remember. Involve me and I will understand!

公告