Reviewed N4 是不是都装了 debug Android 4.2# PDA - 掌中宝
x*3
1 楼
看到150题出第5版了. 有人看过吗? 正找工作, 如果谁有eCopy, 可否传一份给我. 谢
谢.
谢.
s*y
2 楼
Va. Beach man in spanking case is denied bond
http://hamptonroads.com/2011/05/va-beach-man-accused-spanking-c
The three young women first became involved with a Beach restaurateur now
facing sexual assault and abduction charges because he promised them college
scholarships, room and board and weekly allowances, they testified at a
preliminary hearing in General District Court on Thursday.
But the so-called Spencer Scholarship Program that 54-year-old Henry Allen
Fitzsimmons offered them required obedience - and bare-bottomed spankings
they said they submitted to out of fear.
After more than an hour of tearful testimony that included details of
encounters between Fitzsimmons and each of the women, Judge Jesse Demps
ruled there was enough evidence to support three charges of object sexual
penetration and two charges of abduction, all felonies. He dismissed five
misdemeanor assault charges brought by those and other women who said they
were victims of the spankings.
A grand jury next will decide whether the five remaining charges merit a
trial. Fitzsimmons will remain in jail without bond, Demps said.
Fitzsimmons' attorney, Moody E. "Sonny" Stallings Jr., called the
accusations "wild."
"He's providing money to these so-called victims. Who's the victim here?"
Stallings asked the judge.
Each of the women who testified Thursday said Fitzsimmons offered them the
opportunity to go to college and better their lives.
"He was supposed to be like a mentor," one said.
None ever began their studies because he told them they were not yet ready,
the women testified.
Still, they met with him weekly and abided by a set of rules; one woman
testified Fitzsimmons ordered her to walk 20 blocks a day and carefully
track her diet. She was also required to detail her spending, she said: "I
had to stay in contact with him daily."
The spankings began for a 21-year-old "Spencer scholar" during what she
thought was an initial counseling session at Fitzsimmons' hotel room, the
woman testified. She said he gave her $300 afterward and told her he could
have her arrested if she told anyone. She said the beatings continued for
five months.
Fitzsimmons sexually assaulted her on three occasions, she testified. She
said she moved into a shelter and went to police after the final incident.
The Virginian-Pilot generally doesn't identify alleged victims of sex crimes.
A second woman, 22, said she reported the spankings to police months after
they occurred because the first woman had come forward and "stood up for us."
"At first, he helped me out financially. He helped me cope with my life,"
she testified. "He made himself to be very caring and to help me get my life
back on track.... It just seemed like an amazing opportunity."
Then came the spankings, she said. Fitzsimmons blocked her exit from a hotel
room until she submitted to a beating, the woman testified. A third woman,
20, described a similar experience.
"I think you're seeing a pattern of victims," prosecutor Tom Murphy told the
judge. "These women are victims. These women are needy. These women are
recruited."
Stallings said the women were motivated by a desire to get even. One of the
accusers went to police because Fitzsimmons had fired her mother from Envy
Bar and Grill at the Oceanfront, he said.
"They continued to work for him," Stallings said. "They continued to take
money from him. They continued to ride around in limousines with him."
Kristin Davis, (757) 222-5131, k***********[email protected]
http://hamptonroads.com/2011/05/va-beach-man-accused-spanking-c
The three young women first became involved with a Beach restaurateur now
facing sexual assault and abduction charges because he promised them college
scholarships, room and board and weekly allowances, they testified at a
preliminary hearing in General District Court on Thursday.
But the so-called Spencer Scholarship Program that 54-year-old Henry Allen
Fitzsimmons offered them required obedience - and bare-bottomed spankings
they said they submitted to out of fear.
After more than an hour of tearful testimony that included details of
encounters between Fitzsimmons and each of the women, Judge Jesse Demps
ruled there was enough evidence to support three charges of object sexual
penetration and two charges of abduction, all felonies. He dismissed five
misdemeanor assault charges brought by those and other women who said they
were victims of the spankings.
A grand jury next will decide whether the five remaining charges merit a
trial. Fitzsimmons will remain in jail without bond, Demps said.
Fitzsimmons' attorney, Moody E. "Sonny" Stallings Jr., called the
accusations "wild."
"He's providing money to these so-called victims. Who's the victim here?"
Stallings asked the judge.
Each of the women who testified Thursday said Fitzsimmons offered them the
opportunity to go to college and better their lives.
"He was supposed to be like a mentor," one said.
None ever began their studies because he told them they were not yet ready,
the women testified.
Still, they met with him weekly and abided by a set of rules; one woman
testified Fitzsimmons ordered her to walk 20 blocks a day and carefully
track her diet. She was also required to detail her spending, she said: "I
had to stay in contact with him daily."
The spankings began for a 21-year-old "Spencer scholar" during what she
thought was an initial counseling session at Fitzsimmons' hotel room, the
woman testified. She said he gave her $300 afterward and told her he could
have her arrested if she told anyone. She said the beatings continued for
five months.
Fitzsimmons sexually assaulted her on three occasions, she testified. She
said she moved into a shelter and went to police after the final incident.
The Virginian-Pilot generally doesn't identify alleged victims of sex crimes.
A second woman, 22, said she reported the spankings to police months after
they occurred because the first woman had come forward and "stood up for us."
"At first, he helped me out financially. He helped me cope with my life,"
she testified. "He made himself to be very caring and to help me get my life
back on track.... It just seemed like an amazing opportunity."
Then came the spankings, she said. Fitzsimmons blocked her exit from a hotel
room until she submitted to a beating, the woman testified. A third woman,
20, described a similar experience.
"I think you're seeing a pattern of victims," prosecutor Tom Murphy told the
judge. "These women are victims. These women are needy. These women are
recruited."
Stallings said the women were motivated by a desire to get even. One of the
accusers went to police because Fitzsimmons had fired her mother from Envy
Bar and Grill at the Oceanfront, he said.
"They continued to work for him," Stallings said. "They continued to take
money from him. They continued to ride around in limousines with him."
Kristin Davis, (757) 222-5131, k***********[email protected]
d*i
3 楼
比如这个：
https://www.newegg.com/Product/Product.aspx?Item=9SIA2F83T90843&ignorebbr=1&
nm_mc=KNC-GoogleMKP-PC&cm_mmc=KNC-GoogleMKP-PC-_-pla-_-Memory+%28Server+
Memory%29-_-9SIA2F83T90843&gclid=CIrv6L3P5dECFU6CfgodWYwL8w&gclsrc=aw.ds
据说是Reg ECC Low Voltage DIMM Memory 只能 for HP/Compaq？
是form factor根本不fit(装不上)，
还是能装但用不了？
请指教！
https://www.newegg.com/Product/Product.aspx?Item=9SIA2F83T90843&ignorebbr=1&
nm_mc=KNC-GoogleMKP-PC&cm_mmc=KNC-GoogleMKP-PC-_-pla-_-Memory+%28Server+
Memory%29-_-9SIA2F83T90843&gclid=CIrv6L3P5dECFU6CfgodWYwL8w&gclsrc=aw.ds
据说是Reg ECC Low Voltage DIMM Memory 只能 for HP/Compaq？
是form factor根本不fit(装不上)，
还是能装但用不了？
请指教！
p*r
4 楼
相比类似的 LG Optimus G.慢太多了。
p*w
5 楼
顶！新版比第四版多了200页
a*o
6 楼
瞎扯，2011的板子支持ECC ram一般都会在型号里带“WS”字样，绝大多数不行。
所谓“一般主板”更是想都别想。
所谓“一般主板”更是想都别想。
f*t
7 楼
又有新版了？坐等。。
p*o
8 楼
一般的X79+E5 v1/v2行吗？
【在 a*o 的大作中提到】
: 瞎扯，2011的板子支持ECC ram一般都会在型号里带“WS”字样，绝大多数不行。
: 所谓“一般主板”更是想都别想。
【在 a*o 的大作中提到】
: 瞎扯，2011的板子支持ECC ram一般都会在型号里带“WS”字样，绝大多数不行。
: 所谓“一般主板”更是想都别想。
d*h
9 楼
今天刚拿到，从Amazon买的：
http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=dealgr
这种书还是有本纸质的比较好吧
http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=dealgr
这种书还是有本纸质的比较好吧
a*o
10 楼
不行，没特别说支持ecc就是不支持。
: 一般的X79 E5 v1/v2行吗？
【在 p***o 的大作中提到】
: 一般的X79+E5 v1/v2行吗？
: 一般的X79 E5 v1/v2行吗？
【在 p***o 的大作中提到】
: 一般的X79+E5 v1/v2行吗？
g*i
11 楼
Changes from the Fourth Edition: The fifth edition includes over 200 pages
of new content, bringing the book from 300 pages to over 500 pages. Major
revisions were done to almost every solution, including a number of
alternate solutions added. The introductory chapters were massively expanded
, as were the opening of each of the chapters under Technical Questions. In
addition, 24 new questions were added.
多了24题和一些方法,同坐等好心人.
of new content, bringing the book from 300 pages to over 500 pages. Major
revisions were done to almost every solution, including a number of
alternate solutions added. The introductory chapters were massively expanded
, as were the opening of each of the chapters under Technical Questions. In
addition, 24 new questions were added.
多了24题和一些方法,同坐等好心人.
a*e
12 楼
都能插进去，就是起不来
ECC非ECC不同用，但是有些主板CPU俩都吃，E3+C6xx好像
但register和nonregister好像完全不行
1&
【在 d******i 的大作中提到】
: 比如这个：
: https://www.newegg.com/Product/Product.aspx?Item=9SIA2F83T90843&ignorebbr=1&
: nm_mc=KNC-GoogleMKP-PC&cm_mmc=KNC-GoogleMKP-PC-_-pla-_-Memory+%28Server+
: Memory%29-_-9SIA2F83T90843&gclid=CIrv6L3P5dECFU6CfgodWYwL8w&gclsrc=aw.ds
: 据说是Reg ECC Low Voltage DIMM Memory 只能 for HP/Compaq？
: 是form factor根本不fit(装不上)，
: 还是能装但用不了？
: 请指教！
ECC非ECC不同用，但是有些主板CPU俩都吃，E3+C6xx好像
但register和nonregister好像完全不行
1&
【在 d******i 的大作中提到】
: 比如这个：
: https://www.newegg.com/Product/Product.aspx?Item=9SIA2F83T90843&ignorebbr=1&
: nm_mc=KNC-GoogleMKP-PC&cm_mmc=KNC-GoogleMKP-PC-_-pla-_-Memory+%28Server+
: Memory%29-_-9SIA2F83T90843&gclid=CIrv6L3P5dECFU6CfgodWYwL8w&gclsrc=aw.ds
: 据说是Reg ECC Low Voltage DIMM Memory 只能 for HP/Compaq？
: 是form factor根本不fit(装不上)，
: 还是能装但用不了？
: 请指教！
r*y
13 楼
板凳, 等...
【在 f*******t 的大作中提到】
: 又有新版了？坐等。。
【在 f*******t 的大作中提到】
: 又有新版了？坐等。。
a*e
14 楼
X79应该是不行，intel还指着服务器芯片组宰一刀呢
C系列的主板配上XEON
不过说实话C系和X系Z系啥的俺没看出区别
照理内存控制器都内置了
【在 p***o 的大作中提到】
: 一般的X79+E5 v1/v2行吗？
C系列的主板配上XEON
不过说实话C系和X系Z系啥的俺没看出区别
照理内存控制器都内置了
【在 p***o 的大作中提到】
: 一般的X79+E5 v1/v2行吗？
a*s
15 楼
同等
【在 x****3 的大作中提到】
: 看到150题出第5版了. 有人看过吗? 正找工作, 如果谁有eCopy, 可否传一份给我. 谢
: 谢.
【在 x****3 的大作中提到】
: 看到150题出第5版了. 有人看过吗? 正找工作, 如果谁有eCopy, 可否传一份给我. 谢
: 谢.
p*r
16 楼
华硕的某些消费类主板直接声明了支持ecc，据说有的华擎也支持：
https://www.asus.com/us/Motherboards/M5A78L-M-PLUS-USB3/specifications/
https://www.asus.com/us/Motherboards/M5A78L-M-PLUS-USB3/specifications/
c*w
17 楼
没有书, 有solution一样的吧, 呵呵.
http://www.crackingthecodinginterview.com/content/download-solu
http://www.crackingthecodinginterview.com/content/download-solu
a*e
18 楼
AMD的？
这个老二的好像松一些，至少俺的N54 ECC非ECC都吃
但是buffered坚决不行
【在 p**********r 的大作中提到】
: 华硕的某些消费类主板直接声明了支持ecc，据说有的华擎也支持：
: https://www.asus.com/us/Motherboards/M5A78L-M-PLUS-USB3/specifications/
这个老二的好像松一些，至少俺的N54 ECC非ECC都吃
但是buffered坚决不行
【在 p**********r 的大作中提到】
: 华硕的某些消费类主板直接声明了支持ecc，据说有的华擎也支持：
: https://www.asus.com/us/Motherboards/M5A78L-M-PLUS-USB3/specifications/
g*y
19 楼
哪里可以下载问题？
【在 c*******w 的大作中提到】
: 没有书, 有solution一样的吧, 呵呵.
: http://www.crackingthecodinginterview.com/content/download-solu
【在 c*******w 的大作中提到】
: 没有书, 有solution一样的吧, 呵呵.
: http://www.crackingthecodinginterview.com/content/download-solu
F*Q
20 楼
1&
just tried second-hand PC3-10600R server sticks on an old AMD mobo, no dice
【在 d******i 的大作中提到】
: 比如这个：
: https://www.newegg.com/Product/Product.aspx?Item=9SIA2F83T90843&ignorebbr=1&
: nm_mc=KNC-GoogleMKP-PC&cm_mmc=KNC-GoogleMKP-PC-_-pla-_-Memory+%28Server+
: Memory%29-_-9SIA2F83T90843&gclid=CIrv6L3P5dECFU6CfgodWYwL8w&gclsrc=aw.ds
: 据说是Reg ECC Low Voltage DIMM Memory 只能 for HP/Compaq？
: 是form factor根本不fit(装不上)，
: 还是能装但用不了？
: 请指教！
f*r
21 楼
同等
a*e
22 楼
R won't fly on consumer board.
ECC unbuffered might work.
dice
★ 发自iPhone App: ChineseWeb 13
【在 F***Q 的大作中提到】
:
: 1&
: just tried second-hand PC3-10600R server sticks on an old AMD mobo, no dice
ECC unbuffered might work.
dice
★ 发自iPhone App: ChineseWeb 13
【在 F***Q 的大作中提到】
:
: 1&
: just tried second-hand PC3-10600R server sticks on an old AMD mobo, no dice
c*l
23 楼
买一本不久得了 也不贵。。
x*3
24 楼
刚拿到书, 还没看. 题是从http://www.crackingthecodinginterview.com考的. 感觉跟第4版差别不大.
Chapter 1 Arrays and Strings
1.1 Unique Characters in String
1.2 Reverse String in C
1.3 Check Permutation
1.4 Replace Spaces
1.5 String Compression
1.6 Rotate Image / Matrix
1.7 Set Row or Column to 0
1.8 Check Rotation Using isSubstring
Chapter 2 Linked Lists
2.1 Remove Duplicates
2.2 Find kth to Last Element
2.3 Delete Node from Middle
2.4 Partition List
2.5 Add Two Lists
2.6 Get Front of Loop in Circular List
2.7 Check Palindrome
Chapter 3 Stacks and Queues
3.1 Implement 3 Stacks with Array
3.2 Stack with min()
3.3 Implement SetOfStacks
3.4 Towers of Hanoi
3.5 Queue Using 2 Stacks
3.6 Sort Stack
3.7 Dog and Cat Shelter
Chapter 4 Trees and Graphs
4.1 Check Balanced
4.2 Find Route Between 2 Nodes
4.3 Create BST with Minimal Height
4.4 Create Linked List of Nodes at Each Depth
4.5 Check if BST
4.6 Find "Next" Node
4.7 Find Common Ancestor
4.8 Check if T2 is a Subtree of T1
4.9 Print All Paths that Sum to a Value
Chapter 5 Bit Manipulation
5.1 Insert M into N
5.2 Print Binary Representation
5.3 Print Next Smallest and Next Largest
5.4 Explain ((n & (n-1)) == 0)
5.5 Count Number of Bits to Convert A to B
5.6 Swap Odd and Even Bits
5.7 Find Missing Number in Array
5.8 Draw Line on Monochrome Screen
Chapter 6 Brain Teasers
6.1 20 Bottles of Pills
6.2 Chess Board with Corners Removed
6.3 Jugs of Water
6.4 Blue-Eyed People on an Island
6.5 Egg Drop Problem
6.6 100 Lockers
Chapter 7 Mathematics and Probability
7.1 Basketball games
7.2 3 Ants on a Triangle
7.3 Intersection of Lines
7.4 Implement Multiply, Subtract and Divide
7.5 Line that would Bisect Two Squares
7.6 Line that Passes Most Number of Points
7.7 Find kth Number with 3, 5 and 7
Chapter 8 Object Oriented Design
8.1 Deck of Cards
8.2 Call Center
8.3 Jukebox
8.4 Parking Lot
8.5 Online Book Reader
8.6 Jigsaw Puzzle
8.7 Chat Server
8.8 Othello
8.9 File system
8.10 Hash Table
Chapter 9 Recursion and Dynamic Programming
9.1 Child Running Up Steps
9.2 Robot on a Grid
9.3 Find the Magic Index
9.4 Subsets of a Set
9.5 Permutations of a String
9.6 All valid Parentheses
9.7 Implement Paint Fill
9.8 Calculate Number of Ways of Making
9.9 Eight Queens
9.10 Stack of Boxes
9.11 Count Number of Valid Boolean Expressions
Chapter 10 Sorting and Searching
10.1 Merge Arrays
10.2 Sort Array by Anagrams
10.3 Find Element in Rotated Array
10.4 Sort Lines in a Large File
10.5 Sorted Array with Some Empty Strings
10.6 Find in Sorted Matrix
10.7 Biggest Tower of Circus People
10.8 Implement getRankOfNumber in stream
Chapter 11 Scalability and Memory Limits
11.1 End of Day Stock Price
11.2 Design Social Network
11.3 Generate Integer Not in File
11.4 Print Duplicate Elements
11.5 Design Web Crawler
11.6 Detect Duplicate URLs
11.7 Implement MRU Cache for Web Server
Chapter 12 Testing
12.1 Find mistake in code
12.2 Code Crashing in Different Places
12.3 Test canMoveTo on Chess Board
12.4 Test Webpage Without Testing Tools
12.5 Test a Pen
12.6 Test ATM
Chapter 13 C and C++
13.1 Last 10 Lines
13.2 Comparison of Hash Table and STL map
13.3 Virtual Functions
13.4 Shallow Copy vs. Deep Copy
13.5 Volatile
13.6 Virtual Destructor
13.7 Copy of Node Data Structure
13.8 Smart Pointer
13.9 Aligned malloc and free
13.10 my2DAlloc with Array Indices
Chapter 14 Java
14.1 Private Constructor
14.2 Return Statement in finally Block
14.3 Final, finally, finalize
14.4 Templates vs. Generics
14.5 Object Reflection
14.6 Circular Array with Iterator and Generics
Chapter 15 Databases
15.1 Tenants with More than One Apartment
15.2 Buildings with Number of Open Requests
15.3 Close all Requests in Building
15.4 Explain Different Types of Joins
15.5 Denormalization
15.6 Entity Relationship Diagram
15.7 Database for Student Grades
Chapter 16 Threads and Locks
16.1 Thread vs Process
16.2 Time in Context Switch
16.3 Dining Philosophers
16.4 Design Class without Deadlocks
16.5 Ensure Order of First, Second and Third
16.6 Threads and Synchronization
Chapter 17 Moderate
17.1 Swap Number
17.2 Tic-Tac-Toe
17.3 Trailing Zeros in n!
17.4 Max of Two Numbers
17.5 Mastermind
17.6 Find Unsorted Range in Array
17.7 Print English Phrase for Integer
17.8 Contiguous Sequence with Largest Sum
17.9 Frequency of Word in Book
17.10 Encoding XML
17.11 Implement rand7 with rand5
17.12 Find All Pairs of Integers that Sum to Value
17.13 Convert Binary Tree to Linked List
17.14 Unconcatenate List of Words
Chapter 18 Hard
18.1 Add Two Numbers
18.2 Shuffle Deck of Cards
18.3 Generate Random Subset
18.4 Count Number of 2s
18.5 Shortest Distance Between 2 Words
18.6 Largest 1 Million Numbers in 1 Billion
18.7 Longest Word Made of Other Words
18.8 Search String for Substrings
18.9 Track Median Value in Stream
18.10 Transform Word into New Word
18.11 Max Black Square in Matrix
18.12 Find Submatrix with Biggest Sum
18.13 Largest rectangle made of words
Chapter 1 Arrays and Strings
1.1 Unique Characters in String
1.2 Reverse String in C
1.3 Check Permutation
1.4 Replace Spaces
1.5 String Compression
1.6 Rotate Image / Matrix
1.7 Set Row or Column to 0
1.8 Check Rotation Using isSubstring
Chapter 2 Linked Lists
2.1 Remove Duplicates
2.2 Find kth to Last Element
2.3 Delete Node from Middle
2.4 Partition List
2.5 Add Two Lists
2.6 Get Front of Loop in Circular List
2.7 Check Palindrome
Chapter 3 Stacks and Queues
3.1 Implement 3 Stacks with Array
3.2 Stack with min()
3.3 Implement SetOfStacks
3.4 Towers of Hanoi
3.5 Queue Using 2 Stacks
3.6 Sort Stack
3.7 Dog and Cat Shelter
Chapter 4 Trees and Graphs
4.1 Check Balanced
4.2 Find Route Between 2 Nodes
4.3 Create BST with Minimal Height
4.4 Create Linked List of Nodes at Each Depth
4.5 Check if BST
4.6 Find "Next" Node
4.7 Find Common Ancestor
4.8 Check if T2 is a Subtree of T1
4.9 Print All Paths that Sum to a Value
Chapter 5 Bit Manipulation
5.1 Insert M into N
5.2 Print Binary Representation
5.3 Print Next Smallest and Next Largest
5.4 Explain ((n & (n-1)) == 0)
5.5 Count Number of Bits to Convert A to B
5.6 Swap Odd and Even Bits
5.7 Find Missing Number in Array
5.8 Draw Line on Monochrome Screen
Chapter 6 Brain Teasers
6.1 20 Bottles of Pills
6.2 Chess Board with Corners Removed
6.3 Jugs of Water
6.4 Blue-Eyed People on an Island
6.5 Egg Drop Problem
6.6 100 Lockers
Chapter 7 Mathematics and Probability
7.1 Basketball games
7.2 3 Ants on a Triangle
7.3 Intersection of Lines
7.4 Implement Multiply, Subtract and Divide
7.5 Line that would Bisect Two Squares
7.6 Line that Passes Most Number of Points
7.7 Find kth Number with 3, 5 and 7
Chapter 8 Object Oriented Design
8.1 Deck of Cards
8.2 Call Center
8.3 Jukebox
8.4 Parking Lot
8.5 Online Book Reader
8.6 Jigsaw Puzzle
8.7 Chat Server
8.8 Othello
8.9 File system
8.10 Hash Table
Chapter 9 Recursion and Dynamic Programming
9.1 Child Running Up Steps
9.2 Robot on a Grid
9.3 Find the Magic Index
9.4 Subsets of a Set
9.5 Permutations of a String
9.6 All valid Parentheses
9.7 Implement Paint Fill
9.8 Calculate Number of Ways of Making
9.9 Eight Queens
9.10 Stack of Boxes
9.11 Count Number of Valid Boolean Expressions
Chapter 10 Sorting and Searching
10.1 Merge Arrays
10.2 Sort Array by Anagrams
10.3 Find Element in Rotated Array
10.4 Sort Lines in a Large File
10.5 Sorted Array with Some Empty Strings
10.6 Find in Sorted Matrix
10.7 Biggest Tower of Circus People
10.8 Implement getRankOfNumber in stream
Chapter 11 Scalability and Memory Limits
11.1 End of Day Stock Price
11.2 Design Social Network
11.3 Generate Integer Not in File
11.4 Print Duplicate Elements
11.5 Design Web Crawler
11.6 Detect Duplicate URLs
11.7 Implement MRU Cache for Web Server
Chapter 12 Testing
12.1 Find mistake in code
12.2 Code Crashing in Different Places
12.3 Test canMoveTo on Chess Board
12.4 Test Webpage Without Testing Tools
12.5 Test a Pen
12.6 Test ATM
Chapter 13 C and C++
13.1 Last 10 Lines
13.2 Comparison of Hash Table and STL map
13.3 Virtual Functions
13.4 Shallow Copy vs. Deep Copy
13.5 Volatile
13.6 Virtual Destructor
13.7 Copy of Node Data Structure
13.8 Smart Pointer
13.9 Aligned malloc and free
13.10 my2DAlloc with Array Indices
Chapter 14 Java
14.1 Private Constructor
14.2 Return Statement in finally Block
14.3 Final, finally, finalize
14.4 Templates vs. Generics
14.5 Object Reflection
14.6 Circular Array with Iterator and Generics
Chapter 15 Databases
15.1 Tenants with More than One Apartment
15.2 Buildings with Number of Open Requests
15.3 Close all Requests in Building
15.4 Explain Different Types of Joins
15.5 Denormalization
15.6 Entity Relationship Diagram
15.7 Database for Student Grades
Chapter 16 Threads and Locks
16.1 Thread vs Process
16.2 Time in Context Switch
16.3 Dining Philosophers
16.4 Design Class without Deadlocks
16.5 Ensure Order of First, Second and Third
16.6 Threads and Synchronization
Chapter 17 Moderate
17.1 Swap Number
17.2 Tic-Tac-Toe
17.3 Trailing Zeros in n!
17.4 Max of Two Numbers
17.5 Mastermind
17.6 Find Unsorted Range in Array
17.7 Print English Phrase for Integer
17.8 Contiguous Sequence with Largest Sum
17.9 Frequency of Word in Book
17.10 Encoding XML
17.11 Implement rand7 with rand5
17.12 Find All Pairs of Integers that Sum to Value
17.13 Convert Binary Tree to Linked List
17.14 Unconcatenate List of Words
Chapter 18 Hard
18.1 Add Two Numbers
18.2 Shuffle Deck of Cards
18.3 Generate Random Subset
18.4 Count Number of 2s
18.5 Shortest Distance Between 2 Words
18.6 Largest 1 Million Numbers in 1 Billion
18.7 Longest Word Made of Other Words
18.8 Search String for Substrings
18.9 Track Median Value in Stream
18.10 Transform Word into New Word
18.11 Max Black Square in Matrix
18.12 Find Submatrix with Biggest Sum
18.13 Largest rectangle made of words
x*3
25 楼
看到150题出第5版了. 有人看过吗? 正找工作, 如果谁有eCopy, 可否传一份给我. 谢
谢.
谢.
p*w
26 楼
顶！新版比第四版多了200页
f*t
27 楼
又有新版了？坐等。。
d*h
28 楼
今天刚拿到，从Amazon买的：
http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=dealgr
这种书还是有本纸质的比较好吧
http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=dealgr
这种书还是有本纸质的比较好吧
g*i
29 楼
Changes from the Fourth Edition: The fifth edition includes over 200 pages
of new content, bringing the book from 300 pages to over 500 pages. Major
revisions were done to almost every solution, including a number of
alternate solutions added. The introductory chapters were massively expanded
, as were the opening of each of the chapters under Technical Questions. In
addition, 24 new questions were added.
多了24题和一些方法,同坐等好心人.
of new content, bringing the book from 300 pages to over 500 pages. Major
revisions were done to almost every solution, including a number of
alternate solutions added. The introductory chapters were massively expanded
, as were the opening of each of the chapters under Technical Questions. In
addition, 24 new questions were added.
多了24题和一些方法,同坐等好心人.
r*y
30 楼
板凳, 等...
【在 f*******t 的大作中提到】
: 又有新版了？坐等。。
【在 f*******t 的大作中提到】
: 又有新版了？坐等。。
a*s
31 楼
同等
【在 x****3 的大作中提到】
: 看到150题出第5版了. 有人看过吗? 正找工作, 如果谁有eCopy, 可否传一份给我. 谢
: 谢.
【在 x****3 的大作中提到】
: 看到150题出第5版了. 有人看过吗? 正找工作, 如果谁有eCopy, 可否传一份给我. 谢
: 谢.
c*w
32 楼
没有书, 有solution一样的吧, 呵呵.
http://www.crackingthecodinginterview.com/content/download-solu
http://www.crackingthecodinginterview.com/content/download-solu
g*y
33 楼
哪里可以下载问题？
【在 c*******w 的大作中提到】
: 没有书, 有solution一样的吧, 呵呵.
: http://www.crackingthecodinginterview.com/content/download-solu
【在 c*******w 的大作中提到】
: 没有书, 有solution一样的吧, 呵呵.
: http://www.crackingthecodinginterview.com/content/download-solu
f*r
34 楼
同等
c*l
35 楼
买一本不久得了 也不贵。。
x*3
36 楼
刚拿到书, 还没看. 题是从http://www.crackingthecodinginterview.com考的. 感觉跟第4版差别不大.
Chapter 1 Arrays and Strings
1.1 Unique Characters in String
1.2 Reverse String in C
1.3 Check Permutation
1.4 Replace Spaces
1.5 String Compression
1.6 Rotate Image / Matrix
1.7 Set Row or Column to 0
1.8 Check Rotation Using isSubstring
Chapter 2 Linked Lists
2.1 Remove Duplicates
2.2 Find kth to Last Element
2.3 Delete Node from Middle
2.4 Partition List
2.5 Add Two Lists
2.6 Get Front of Loop in Circular List
2.7 Check Palindrome
Chapter 3 Stacks and Queues
3.1 Implement 3 Stacks with Array
3.2 Stack with min()
3.3 Implement SetOfStacks
3.4 Towers of Hanoi
3.5 Queue Using 2 Stacks
3.6 Sort Stack
3.7 Dog and Cat Shelter
Chapter 4 Trees and Graphs
4.1 Check Balanced
4.2 Find Route Between 2 Nodes
4.3 Create BST with Minimal Height
4.4 Create Linked List of Nodes at Each Depth
4.5 Check if BST
4.6 Find "Next" Node
4.7 Find Common Ancestor
4.8 Check if T2 is a Subtree of T1
4.9 Print All Paths that Sum to a Value
Chapter 5 Bit Manipulation
5.1 Insert M into N
5.2 Print Binary Representation
5.3 Print Next Smallest and Next Largest
5.4 Explain ((n & (n-1)) == 0)
5.5 Count Number of Bits to Convert A to B
5.6 Swap Odd and Even Bits
5.7 Find Missing Number in Array
5.8 Draw Line on Monochrome Screen
Chapter 6 Brain Teasers
6.1 20 Bottles of Pills
6.2 Chess Board with Corners Removed
6.3 Jugs of Water
6.4 Blue-Eyed People on an Island
6.5 Egg Drop Problem
6.6 100 Lockers
Chapter 7 Mathematics and Probability
7.1 Basketball games
7.2 3 Ants on a Triangle
7.3 Intersection of Lines
7.4 Implement Multiply, Subtract and Divide
7.5 Line that would Bisect Two Squares
7.6 Line that Passes Most Number of Points
7.7 Find kth Number with 3, 5 and 7
Chapter 8 Object Oriented Design
8.1 Deck of Cards
8.2 Call Center
8.3 Jukebox
8.4 Parking Lot
8.5 Online Book Reader
8.6 Jigsaw Puzzle
8.7 Chat Server
8.8 Othello
8.9 File system
8.10 Hash Table
Chapter 9 Recursion and Dynamic Programming
9.1 Child Running Up Steps
9.2 Robot on a Grid
9.3 Find the Magic Index
9.4 Subsets of a Set
9.5 Permutations of a String
9.6 All valid Parentheses
9.7 Implement Paint Fill
9.8 Calculate Number of Ways of Making
9.9 Eight Queens
9.10 Stack of Boxes
9.11 Count Number of Valid Boolean Expressions
Chapter 10 Sorting and Searching
10.1 Merge Arrays
10.2 Sort Array by Anagrams
10.3 Find Element in Rotated Array
10.4 Sort Lines in a Large File
10.5 Sorted Array with Some Empty Strings
10.6 Find in Sorted Matrix
10.7 Biggest Tower of Circus People
10.8 Implement getRankOfNumber in stream
Chapter 11 Scalability and Memory Limits
11.1 End of Day Stock Price
11.2 Design Social Network
11.3 Generate Integer Not in File
11.4 Print Duplicate Elements
11.5 Design Web Crawler
11.6 Detect Duplicate URLs
11.7 Implement MRU Cache for Web Server
Chapter 12 Testing
12.1 Find mistake in code
12.2 Code Crashing in Different Places
12.3 Test canMoveTo on Chess Board
12.4 Test Webpage Without Testing Tools
12.5 Test a Pen
12.6 Test ATM
Chapter 13 C and C++
13.1 Last 10 Lines
13.2 Comparison of Hash Table and STL map
13.3 Virtual Functions
13.4 Shallow Copy vs. Deep Copy
13.5 Volatile
13.6 Virtual Destructor
13.7 Copy of Node Data Structure
13.8 Smart Pointer
13.9 Aligned malloc and free
13.10 my2DAlloc with Array Indices
Chapter 14 Java
14.1 Private Constructor
14.2 Return Statement in finally Block
14.3 Final, finally, finalize
14.4 Templates vs. Generics
14.5 Object Reflection
14.6 Circular Array with Iterator and Generics
Chapter 15 Databases
15.1 Tenants with More than One Apartment
15.2 Buildings with Number of Open Requests
15.3 Close all Requests in Building
15.4 Explain Different Types of Joins
15.5 Denormalization
15.6 Entity Relationship Diagram
15.7 Database for Student Grades
Chapter 16 Threads and Locks
16.1 Thread vs Process
16.2 Time in Context Switch
16.3 Dining Philosophers
16.4 Design Class without Deadlocks
16.5 Ensure Order of First, Second and Third
16.6 Threads and Synchronization
Chapter 17 Moderate
17.1 Swap Number
17.2 Tic-Tac-Toe
17.3 Trailing Zeros in n!
17.4 Max of Two Numbers
17.5 Mastermind
17.6 Find Unsorted Range in Array
17.7 Print English Phrase for Integer
17.8 Contiguous Sequence with Largest Sum
17.9 Frequency of Word in Book
17.10 Encoding XML
17.11 Implement rand7 with rand5
17.12 Find All Pairs of Integers that Sum to Value
17.13 Convert Binary Tree to Linked List
17.14 Unconcatenate List of Words
Chapter 18 Hard
18.1 Add Two Numbers
18.2 Shuffle Deck of Cards
18.3 Generate Random Subset
18.4 Count Number of 2s
18.5 Shortest Distance Between 2 Words
18.6 Largest 1 Million Numbers in 1 Billion
18.7 Longest Word Made of Other Words
18.8 Search String for Substrings
18.9 Track Median Value in Stream
18.10 Transform Word into New Word
18.11 Max Black Square in Matrix
18.12 Find Submatrix with Biggest Sum
18.13 Largest rectangle made of words
Chapter 1 Arrays and Strings
1.1 Unique Characters in String
1.2 Reverse String in C
1.3 Check Permutation
1.4 Replace Spaces
1.5 String Compression
1.6 Rotate Image / Matrix
1.7 Set Row or Column to 0
1.8 Check Rotation Using isSubstring
Chapter 2 Linked Lists
2.1 Remove Duplicates
2.2 Find kth to Last Element
2.3 Delete Node from Middle
2.4 Partition List
2.5 Add Two Lists
2.6 Get Front of Loop in Circular List
2.7 Check Palindrome
Chapter 3 Stacks and Queues
3.1 Implement 3 Stacks with Array
3.2 Stack with min()
3.3 Implement SetOfStacks
3.4 Towers of Hanoi
3.5 Queue Using 2 Stacks
3.6 Sort Stack
3.7 Dog and Cat Shelter
Chapter 4 Trees and Graphs
4.1 Check Balanced
4.2 Find Route Between 2 Nodes
4.3 Create BST with Minimal Height
4.4 Create Linked List of Nodes at Each Depth
4.5 Check if BST
4.6 Find "Next" Node
4.7 Find Common Ancestor
4.8 Check if T2 is a Subtree of T1
4.9 Print All Paths that Sum to a Value
Chapter 5 Bit Manipulation
5.1 Insert M into N
5.2 Print Binary Representation
5.3 Print Next Smallest and Next Largest
5.4 Explain ((n & (n-1)) == 0)
5.5 Count Number of Bits to Convert A to B
5.6 Swap Odd and Even Bits
5.7 Find Missing Number in Array
5.8 Draw Line on Monochrome Screen
Chapter 6 Brain Teasers
6.1 20 Bottles of Pills
6.2 Chess Board with Corners Removed
6.3 Jugs of Water
6.4 Blue-Eyed People on an Island
6.5 Egg Drop Problem
6.6 100 Lockers
Chapter 7 Mathematics and Probability
7.1 Basketball games
7.2 3 Ants on a Triangle
7.3 Intersection of Lines
7.4 Implement Multiply, Subtract and Divide
7.5 Line that would Bisect Two Squares
7.6 Line that Passes Most Number of Points
7.7 Find kth Number with 3, 5 and 7
Chapter 8 Object Oriented Design
8.1 Deck of Cards
8.2 Call Center
8.3 Jukebox
8.4 Parking Lot
8.5 Online Book Reader
8.6 Jigsaw Puzzle
8.7 Chat Server
8.8 Othello
8.9 File system
8.10 Hash Table
Chapter 9 Recursion and Dynamic Programming
9.1 Child Running Up Steps
9.2 Robot on a Grid
9.3 Find the Magic Index
9.4 Subsets of a Set
9.5 Permutations of a String
9.6 All valid Parentheses
9.7 Implement Paint Fill
9.8 Calculate Number of Ways of Making
9.9 Eight Queens
9.10 Stack of Boxes
9.11 Count Number of Valid Boolean Expressions
Chapter 10 Sorting and Searching
10.1 Merge Arrays
10.2 Sort Array by Anagrams
10.3 Find Element in Rotated Array
10.4 Sort Lines in a Large File
10.5 Sorted Array with Some Empty Strings
10.6 Find in Sorted Matrix
10.7 Biggest Tower of Circus People
10.8 Implement getRankOfNumber in stream
Chapter 11 Scalability and Memory Limits
11.1 End of Day Stock Price
11.2 Design Social Network
11.3 Generate Integer Not in File
11.4 Print Duplicate Elements
11.5 Design Web Crawler
11.6 Detect Duplicate URLs
11.7 Implement MRU Cache for Web Server
Chapter 12 Testing
12.1 Find mistake in code
12.2 Code Crashing in Different Places
12.3 Test canMoveTo on Chess Board
12.4 Test Webpage Without Testing Tools
12.5 Test a Pen
12.6 Test ATM
Chapter 13 C and C++
13.1 Last 10 Lines
13.2 Comparison of Hash Table and STL map
13.3 Virtual Functions
13.4 Shallow Copy vs. Deep Copy
13.5 Volatile
13.6 Virtual Destructor
13.7 Copy of Node Data Structure
13.8 Smart Pointer
13.9 Aligned malloc and free
13.10 my2DAlloc with Array Indices
Chapter 14 Java
14.1 Private Constructor
14.2 Return Statement in finally Block
14.3 Final, finally, finalize
14.4 Templates vs. Generics
14.5 Object Reflection
14.6 Circular Array with Iterator and Generics
Chapter 15 Databases
15.1 Tenants with More than One Apartment
15.2 Buildings with Number of Open Requests
15.3 Close all Requests in Building
15.4 Explain Different Types of Joins
15.5 Denormalization
15.6 Entity Relationship Diagram
15.7 Database for Student Grades
Chapter 16 Threads and Locks
16.1 Thread vs Process
16.2 Time in Context Switch
16.3 Dining Philosophers
16.4 Design Class without Deadlocks
16.5 Ensure Order of First, Second and Third
16.6 Threads and Synchronization
Chapter 17 Moderate
17.1 Swap Number
17.2 Tic-Tac-Toe
17.3 Trailing Zeros in n!
17.4 Max of Two Numbers
17.5 Mastermind
17.6 Find Unsorted Range in Array
17.7 Print English Phrase for Integer
17.8 Contiguous Sequence with Largest Sum
17.9 Frequency of Word in Book
17.10 Encoding XML
17.11 Implement rand7 with rand5
17.12 Find All Pairs of Integers that Sum to Value
17.13 Convert Binary Tree to Linked List
17.14 Unconcatenate List of Words
Chapter 18 Hard
18.1 Add Two Numbers
18.2 Shuffle Deck of Cards
18.3 Generate Random Subset
18.4 Count Number of 2s
18.5 Shortest Distance Between 2 Words
18.6 Largest 1 Million Numbers in 1 Billion
18.7 Longest Word Made of Other Words
18.8 Search String for Substrings
18.9 Track Median Value in Stream
18.10 Transform Word into New Word
18.11 Max Black Square in Matrix
18.12 Find Submatrix with Biggest Sum
18.13 Largest rectangle made of words
w*p
37 楼
1. 顶一下，请问谁有电子版？
2。如果大家都没有，请问在哪儿可以买到电子版。
（我找了一圈－2小时也没找到电子版。哭）
谢谢。
2。如果大家都没有，请问在哪儿可以买到电子版。
（我找了一圈－2小时也没找到电子版。哭）
谢谢。
相关阅读
ebay unlock code如何播放.ts格式的3D视频文件？？ (转载)好像发现了nexus7屏幕问题发生的规律记得以前老手机有危害小弟弟的危险，现在的smartphone危害小弟弟吗？在apple store或者att、verizon店买new ipad是立即带走吗 (转载)求推荐$100以内used AT&T smartphone为什么所有app都开始安装后自动运行了？手机求推荐nexus 7壳子和保护膜求推荐hotmail一段时间不用，还有被关帐号吗？闲话微软---的一点补充one x overheat problem热烈祝贺戴晓翔创造了男子射箭的历史。争夺铜牌吧。热烈祝贺中国羽毛球女双最终拿到金牌！！！！！garmin在navigate的时候怎么样才能让USB供电？安猪下和windows下都有哪个好用的gif制作软件呢？Nexus 7用Google Offline Map导航行吗？HTC要接奥运会翻盘吗？很多人带那种耳机啊微软失落的十年 Microsoft’s Lost DecadeHow about this one ? Sony Tablet?