修改动态规划-线性动态规划-线性dp规划(一)中最长重复子数组条件描述 #122
Open
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.
感谢作者大大的一直奉献!最近本人也在学习算法,动归整理的很好很有帮助,不过最长重复子数组这里原来的状态转移方程描述似乎有些问题,按照我的理解是无法保证无后效性的,改成了我认为更合适的描述