Clever Castle
Home
Archive
About
GitHub
Home
Archive
About
GitHub
ivyxjc
Categories
Algorithm
4
OJ题解
6
SourceCodeAnalysis
1
TechDetail
12
TechReview
3
Tutorial
12
Tags
aws
binary-tree
cron
design-pattern
disruptor
docker
dynamic-programming
fibonacci
git
gradle
infrastructure
IOC
java
java11
jms
k8s
kafka
kubernetes
lambda
leetcode
linkedlist
linux
network
OJ
pat
postgres
redis
segment-tree
spring
设计模式
More
67 words
1 minutes
动态规划简介
2016-12-06
Algorithm
dynamic-programming
钢条切割问题
#
不同长度的钢条可以售出不同的价格, 现有一根长度为n的钢条, 现切割该钢条成不同长度的子钢条, 那么最佳的
矩阵链问题
#
最长公共子序列问题
#
动态规划简介
https://blog.ivyxjc.com/posts/dynamic-programming-intro/
Author
ivyxjc
Published at
2016-12-06
License
CC BY-NC-SA 4.0
Spring装配bean
观察者模式
© 2024 ivyxjc. All Rights Reserved.
Powered by
Fuwari