- 博客(1)
- 资源 (16)
- 收藏
- 关注
原创 每日一题3:两数相加
问题描述 给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。 如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。 您可以假设除了数字 0 之外,这两个数都不会以 0 开头。 示例: 输入:(2 -> 4 -> 3) + (5 -> 6 -> 4) 输出:7 -> 0 ...
2019-10-06 16:12:54 317
Approximation Algorithms.rar
Most natural optimization problems, including those arising in important
application areas, are NP-hard. Therefore, under the widely believed conjecture
that P -=/= NP, their exact solution is prohibitively time consuming.
Charting the landscape of approximability of these problems, via polynomial
time algorithms, therefore becomes a compelling subject of scientific inquiry
in computer science and mathematics. This book presents the theory of approximation
algorithms as it stands today. It is reasonable to expect the
picture to change with time.
This book is divided into three parts. In Part I we cover combinatorial
algorithms for a number of important problems, using a wide variety
of algorithm design techniques. The latter may give Part I a non-cohesive
appearance. However, this is to be expected - nature is very rich, and we
cannot expect a few tricks to help solve the diverse collection of NP-hard
problems. Indeed, in this part, we have purposely refrained from tightly categorizing
algorithmic techniques so as not to trivialize matters. Instead, we
have attempted to capture, as accurately as possible, the individual character
of each problem, and point out connections between problems and algorithms
for solving them.
In Part II, we present linear programming based algorithms. These are
categorized under two fundamental techniques: rounding and the primaldual
schema. But once again, the exact approximation guarantee obtainable
depends on the specific LP-relaxation used, and there is no fixed recipe for
discovering good relaxations, just as there is no fixed recipe for proving a theorem
in mathematics (readers familiar with complexity theory will recognize
this as the philosophical point behind the P -=/= NP question).
2020-04-26
牛津字典(欧路词典).txt
由于连接太容易吞,所以放到文档里。打开即可完成百度云连接下载。有问题可以在评论区留言。由于连接太容易吞,所以放到文档里。打开即可完成百度云连接下载。有问题可以在评论区留言。由于连接太容易吞,所以放到文档里。打开即可完成百度云连接下载。有问题可以在评论区留言。
2020-03-29
STL_帮助文档
2016-11-26
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人