剪刀@staples - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>PennySaver - 省钱一族

剪刀@staples

剪刀@staples# PennySaver - 省钱一族

m*n2011-12-12 08:12

1 楼

想问一下拿到offer的大牛，究竟该如何做leetcode？
我第一遍大概做了有100多道题吧，中间因为忙停下来了，今年暑假又重头做了一遍，
现在做了有200多道了，我发现我原来会的题还是会，不会的题还是容易忘记解法，现
在每天刷三题，可是感觉我的进度总是赶不上leetcode新出的题，好有挫败感，想问问
你们，我现在应该停下来把原来的题回顾一下总结一下，还是得继续刷题，可是我怕我
不刷，等再开始刷的时候，有多了100多道题啊。。。
我还是在读phd，不是cs系的，每天还有其他活要干，所以也就能抽出2-3个小时来刷题

m*82011-12-12 08:12

2 楼

那天有人问便宜剪刀？
这个星期@staples一刀一个，limits 2.
good luck

j*o2011-12-12 08:12

3 楼

背解法没用，你要理解为啥用这种方法比别的方法快

d*e2011-12-12 08:12

4 楼

感觉要一鼓作气
走走停停没有效果

m*n2011-12-12 08:12

5 楼

有的方法当时理解，可是过后，毕竟不是自己的想法就很容易忘掉。而且有的时候不是
时间复杂度的问题，而是一些问题我连解都不会解，都是看别人的解法。。。

【在 j******o 的大作中提到】

: 背解法没用，你要理解为啥用这种方法比别的方法快

z*32011-12-12 08:12

6 楼

你需要练内功易筋经

【在 m**********n 的大作中提到】

: 想问一下拿到offer的大牛，究竟该如何做leetcode？
: 我第一遍大概做了有100多道题吧，中间因为忙停下来了，今年暑假又重头做了一遍，
: 现在做了有200多道了，我发现我原来会的题还是会，不会的题还是容易忘记解法，现
: 在每天刷三题，可是感觉我的进度总是赶不上leetcode新出的题，好有挫败感，想问问
: 你们，我现在应该停下来把原来的题回顾一下总结一下，还是得继续刷题，可是我怕我
: 不刷，等再开始刷的时候，有多了100多道题啊。。。
: 我还是在读phd，不是cs系的，每天还有其他活要干，所以也就能抽出2-3个小时来刷题

x*a2011-12-12 08:12

7 楼

拿出半个月把introduction to algorithms 3rd 前半部分看了
再做题就会感觉豁然开朗

【在 m**********n 的大作中提到】

s*x2011-12-12 08:12

8 楼

我也在刷题，请问 introduction to algorithms 3rd 后半部分需要仔细看吗？动态编
程看完了，后面就是B树，图论。
希望指点一下！
谢谢！

【在 x*****a 的大作中提到】

: 拿出半个月把introduction to algorithms 3rd 前半部分看了
: 再做题就会感觉豁然开朗

d*z2011-12-12 08:12

9 楼

----------------------
大学时候来米国，就发现米疣叫兽和作家喜欢故弄玄虚。
常常把简单的东西说成复杂，并且故意忽略关键部分。
而藤校学生也较自负虚荣，不懂装懂，怕被其它同学看衰。
这些叫兽也深谙学生的心理弱点，故意让它们没学到。
但我一般很快就问到关键的东西，每次他们都非常不爽。
愚蠢虚荣的狗蝇被耍了还敬仰万分，赞叫兽们高深莫测。
当然，如果你熟悉盗魔经，这一切都不奇怪，还可以预见。
盗魔经信徒对狗蝇没有好意，尤其最忌聪明本领的狗蝇。
关于上面那本书的评论：
2 star)show all reviews
289 of 307 people found the following review helpful
2.0 out of 5 stars
Magisterial, and impenetrable
ByClinton Staleyon August 29, 2011
Format: Hardcover
I'm a professor of Computer Science at a respected teaching university, and
have been the principal instructor of our introductory algorithms class for
the past several years. I used Cormen (doesn't *everyone*?) for a year or
two, but have finally relegated it to recommended-text status.
On the plus side, the text is, as my review title says, magisterial. It
covers the field comprehensively and authoritatively. When one of the
authors is the "R" in RSA, and others are well-known names, you can count on
the text's expertise and accuracy. I've never found an error in this text.
BUT.... The pedagogy needs work. Explanations tend to jump too quickly to
pure mathematical notation, and there are often insufficient concrete
examples. The pseudocode has one-letter variable names that appear at times
to be randomly generated :). At least the latest edition fixes what was a
baffling indentation style. If you took a sample of 100 CS undergrads and
asked them to learn algorithms principally from this text, I'd venture a
guess that only the 10 brightest could do so. And even they'd be baffled at
times.
I apologize for having to offer such an "emperor is naked" review to such a
highly respected work, but it's time to consider more carefully pedagogical
texts in the undergrad market.
Patrick Kasarski1 year ago
Report abuse
I agree. If you are writing a PhD dissertation this book will be useful. If
you want to learn algorithms as an undergrad or for a job interview, it's
overkill. I would recommend Algorithms by Robert Sedgewick and Kevin Wayne.
It's about 1/4 the length but focuses on the essentials in a way that will
be more immediately useful to mere mortals. If you think you need more
detail then you can always turn to CLRS as a reference. But in most cases,
you don't.
---------------------
I own copies of all of these books btw (a few in digital formats, not all
of them in print) and can personally speak to their quality in offering
clearer, easier-to-understand explanations of algorithms.
- Data Structures In C, by Noel Kalicharan
- Data Structures and Algorithms in C++ (3rd Edition), by Adam Drozdek (can'
t speak to the newer 4th Edition)
- Data Structures and Algorithms in Java (2nd Edition), by Robert Lafore
- Algorithms (4th Edition), by Robert Sedgewick & Kevin Wayne (uses Java)
- Problem Solving with Algorithms and Data Structures Using Python SECOND
EDITION, by Bradley Miller & David Ranum
If you're a college student that has to buy this book for your algorithms
class like I had to, there are a variety of free resources online that
should make the subject easier to learn along the way, like the MIT Open
CourseWare resources on algorithms (course numbers 6.006 and 6.046),
StackOverflow, GeeksforGeeks, and the sheer quantity of lecture slides
available online at other colleges & universities. Coursera regularly has a
free class on the subject as well.
Thank you. On my desk I have the following books that I have read:
"Data Structures & Algorithms in Java" by Lafore
"Algorithms" by Sedgewick
"Programming Pearls" by Bentley
"Advanced Data Structures" by Brass.
Every one of these books is easier to understand than is Cormen. I am
baffled that there are CS instructors who believe that Cormen is the first
choice--it's not. I'm glad I have it to study and I'm also glad that it wasn
't my first exposure to these topics.
Check out "Algorithms" by Dasgupta, Papadimitriou and Vazirani. Free and
legal pdf available online. You will thank me later.
http://www.amazon.com/Introduction-Algorithms-Edition-Thomas-Co

【在 m**********n 的大作中提到】

E*g2011-12-12 08:12

10 楼

Thank you for your information!

【在 d**z 的大作中提到】

:
: ----------------------
: 大学时候来米国，就发现米疣叫兽和作家喜欢故弄玄虚。
: 常常把简单的东西说成复杂，并且故意忽略关键部分。
: 而藤校学生也较自负虚荣，不懂装懂，怕被其它同学看衰。
: 这些叫兽也深谙学生的心理弱点，故意让它们没学到。
: 但我一般很快就问到关键的东西，每次他们都非常不爽。
: 愚蠢虚荣的狗蝇被耍了还敬仰万分，赞叫兽们高深莫测。
: 当然，如果你熟悉盗魔经，这一切都不奇怪，还可以预见。
: 盗魔经信徒对狗蝇没有好意，尤其最忌聪明本领的狗蝇。

x*a2011-12-12 08:12

11 楼

貌似一般公司面试不会问太高级的数据结构
那些东西代码都比较长，时间不够考的
比如像红黑树这玩艺儿，我觉得就没几个人能不看书写出插入算法，而且也实际中这么
麻烦的东西也没啥人用
图论这东西据说不大考，但我也见过简单的跟图相关的面试题，所以基本概念还是要知
道一下

【在 s**********x 的大作中提到】

: 我也在刷题，请问 introduction to algorithms 3rd 后半部分需要仔细看吗？动态编
: 程看完了，后面就是B树，图论。
: 希望指点一下！
: 谢谢！

s*x2011-12-12 08:12

12 楼

谢谢！

【在 x*****a 的大作中提到】

: 貌似一般公司面试不会问太高级的数据结构
: 那些东西代码都比较长，时间不够考的
: 比如像红黑树这玩艺儿，我觉得就没几个人能不看书写出插入算法，而且也实际中这么
: 麻烦的东西也没啥人用
: 图论这东西据说不大考，但我也见过简单的跟图相关的面试题，所以基本概念还是要知
: 道一下

k*e2011-12-12 08:12

13 楼

我推荐The Algorithm Design Manual。