Open
Conversation
added 3 commits
October 14, 2014 19:44
implement a dynamic programming algorithm that finds the minimum number of operations needed to transform string A into string B
find the maximum net profit
activity selection problem: select the maximum sum of mutually disjoint intervals
Owner
|
Hi 非常感谢， 格式方面，你增加了三道题，但是没有与本书集成，是独立的一个pdf，你能否再组织一下，集成到书中的某一章节？ 内容方面，等我有空看一下这三道题是否经典。 |
minimum operation transform between strings, solved by dynamic programming
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
1.任务调度问题
2. 字符串转换操作问题
3. 活动间隔选择问题