It’s coming!!
Finally, I sorted out the PDF of the first version of sword Offer, mainly in Java language, with 67 questions and more than 100 pages.
Get the way as follows (no routine direct access to baidu web disk 🔗 link, if the link failure can directly find me) :
[Qinhuai grocery store] public number sent: sword refers to Offer
Desolution, which is classified as follows:
An array of
Offer (2) — Find Offer (13) in a two-dimensional array — reorder the array so that an odd number precedes an even number Offer (19) — print matrix Offer (28) — more than half of the number in array Offer (30) — The maximum sum of a continuous subarray refers to Offer (35) — the reverse pair in the array refers to Offer (37) — the number of occurrences of the number in the ascending array — Offer (40) — the number of occurrences of the number in the array only once — Offer (50) — the number of repeats in the array Finger Offer (51) — builds product array
string
The sword refers to Offer (2) — replace space sword refers to Offer (27) — the string sort sword refers to Offer (34) — the first character sword that appears only once refers to Offer (43) — the left rotation string sword refers to Offer (44) — flips word sequence Finger Offer (44) — flips word sequences (no API calls) Finger Offer (49) — converts string to integer finger Offer (53) — numeric string finger Offer (54) — first non-repeating character in character stream Finger Offer (64) – sliding window maximum
The list
Print the list from end to end. Print the list from end to end. Print the list from end to end Offer (36) — the first common node of both lists — entry node Offer (56) in the middle of the list — removes duplicate elements in the list
The stack and queue
Offer (8) – with two stacks to achieve queue Offer (20) – containing min function of the stack of Offer (21) – stack push, pop-up sequence
The heap
Offer (29) – minimum k number
Search algorithm
Finger Offer (63) – median of data flow
Dynamic programming
Offer (6) — Fibonacci sequence Offer (7) — Jump step Offer (10) — Rectangular overlay Offer (52) — Regular expression matching (dynamic programming)
back
Offer (65) — path in matrix (classical backtracking) Offer (66) — range of motion of robot
The sorting
Finger Offer (thirty-two) – arrange the array into the smallest number
An operation
Sword refers to Offer (eleven) – the number of 1’s in binary. Sword refers to Offer (thirty-one) – the number of 1’s in integer. Sword refers to Offer (forty-eight) – does not use addition, subtraction, multiplication and division to add
Binary tree
The sword refers to Offer (4) — rebuild the binary tree sword refers to Offer (17) — the substructure of the tree sword refers to Offer (18) — the mirror sword of the binary tree refers to Offer (22) — Print the binary tree sword refers to Offer (23) — the backward traversal sequence of the binary tree search tree Sword refers to Offer (24) — binary tree and path of a certain value sword refers to Offer (26) — binary search tree and bidirectional linked list sword refers to Offer (38) — tree depth sword refers to Offer (39) — balanced binary tree sword refers to Offer (57) — the next node of the binary tree Offer (58) — symmetric binary tree Offer (59) — Print the binary tree Offer (60) in zigzag order — print the binary tree as multiple lines Offer (61) — serialize the binary tree Offer (62) — the KTH node of the binary search tree
Other algorithms
Abnormal version refers to Offer (12) — integer power of value refers to Offer (33) — ugly number refers to Offer (41) — and is a sequence of consecutive positive numbers refers to Offer (42) — and is two numbers of S Sword finger Offer (45) — Poker hand hand sword finger Offer (46) — last round soldier (Joseph) sword finger Offer (47) — 1+2+… +n summation (without loop or multiplication) refers to Offer (67) — cut string
Why do we need to do this brush problem warehouse?
Algorithm questions have become the standard of each factory interview, and algorithm questions is not a matter of one day, every day or every two days, brush a question, or learn a way of thinking, as long as hold on, not so afraid of the algorithm. This is an obstacle, but overcoming it psychologically is half the battle. Constant training, however, can make people less fearful.
Usually business code to write much, it seems that there is no use of algorithms. It’s not, for example, the algorithm is hidden when we call sort(). The realization of the inside is also optimized by the author version by version. A person who can solve complex algorithms tends to write beautiful code. So the algorithm, in fact, has developed the ability to deal with complex problems, and it’s less likely to confuse itself when writing business code.
I am interested in algorithms. Every time I see some magical algorithms, I always think, how can these people be so amazing? The strange knowledge increased. The joy comes when you suddenly figure out an algorithm problem, or see someone else’s more elegant solution and understand it. It’s a simple pleasure.
Of course, we don’t want to spend a lot of time trying to get the efficiency from 0.9999 to 1 on a particular problem. Time is precious for everyone. In front of time and a certain knowledge point, I think everyone has their own balance strategy, if you happy, you do. But what we’re trying to do is solve a problem, at least under limited conditions, and the optimizations that most people can think of, we can come up with.
About the author
Qin Huai, author of public number [Qin Huai Grocery store], the road of technology is not at that time, the mountain is high and the water is long, even if slow, and not stop. Personal Writing Direction: Java source code analysis, JDBC, Mybatis, Spring, Redis, distributed, sword Offer, LeetCode, etc., carefully write each article, do not like the title party, do not like the flowery, mostly write a series of articles, can not guarantee that I write are completely correct, But I guarantee that what I write is done through practice or research. We hope to correct any omissions or mistakes.
What did I write about 2020?
Open Source Programming Notes