【文件属性】：
文件名称：leetcode答案-MIT-6.006-Introduction-to-Algorithms:https://ocw.mit.edu/cou
文件大小：3.56MB
文件格式：ZIP
更新时间：2021-06-30 00:56:02
系统开源
leetcode
答案
MIT-6.006-Introduction-to-Algorithms
麻省理工
6.006
算法导论
Video
视频
CLRS
3rd
edition
算法导论
第三版
If
you
are
not
tight
in
budgets,
consider
buying
one
at
资金充足的话，可以考虑去买一本
I
recommend
.
You
can
find
almost
all
the
answers
of
CLRS
here.
From
now
on
in
light
of
my
limited
time
and
energy,
updates
will
be
mainly
related
LeetCode
problems.
Do
LeetCode
questions
in
a
chapter/topic
oriented
manner
works
espcially
for
me.
I
prefer
learn
anything
systematcially.
【文件预览】：
MIT-6.006-Introduction-to-Algorithms-master
----Quicksort()
--------quicksort.md(271B)
--------7.1 exercises.md(3KB)
----HeapSort()
--------MIT6_006F11_lec04.pdf(623KB)
--------none(1B)
----Elementary Graph Algorithms()
--------22.1 exercises.md(3KB)
--------Breadth-first search.md(509B)
--------22.2 exercises.md(1B)
----Dynamic Programming()
--------Rod cutting()
--------Needleman-Wunsch algorithm()
--------LC64 Minimum Path Sum.md(659B)
--------Matrix-chain multiplication()
--------readme.md(362B)
----Unit 1- Introduction()
--------PeakFinding.md(3KB)
--------MIT6_006F11_lec01.pdf(1.89MB)
--------MIT6_006F11_lec02.pdf(944KB)
----README.md(1KB)
----Single-Source Shortest Paths()
--------LC787.md(1KB)
--------Dijkstra.md(4KB)
--------Bellman-Ford.md(4KB)
--------readme.md(148B)
--------24.1.md(483B)
----Divide and Conquer()
--------Maximum subarray problem()