My “road of algorithmic clearance” has been published!

Time:2022-5-16

In fact, many friends privately asked me:

  • When will the new book be published?
  • Can I make a reservation?
  • wait

In fact, I am more anxious than everyone else, but publishing books is really a very rigorous process. No more than columns, pamphlets and other electronic books can be modified while they are on the shelf. The requirements and processes of traditional paper books are strictly controlled. Therefore, we can only wait patiently and cooperate with the publishing house. Now the road of algorithmic customs clearance is finally going to meet you!

Many students have already booked, and some even booked dozens of times, which really moved western France!

Here are some of the students who e-mailed me to book:

My

Although the content has been decided for a long time, the process in the middle is extremely tortuous. In short, it is all kinds of things, but fortunately it has been published now.Thank you for your encouragement and support, otherwise I’m afraid it’s hard for me to stick to it

Let’s show you the cover of a new book.

My

What are the dry goods in this book? Here is a brief introduction to western France. You can scan the QR code at the end of the article to see the detailed directory.

  • Chapter 1 summarizes and combs some basic data structures and algorithms, and introduces the common method to measure program performance – Big O representation.
  • Chapter 2 is the special topic of mathematics. Many algorithm problems need you to have some mathematical knowledge to solve. What mathematical knowledge do you need and how difficult is it? This chapter will tell you.
  • Chapter 3 is about a classical algorithm problem – palindrome problem.
  • Chapter 4 is the game topic. From the perspective of problems, game topics can be divided into solving and game. Game problems will be specially analyzed in Chapter 12. This chapter will focus on solving games.
  • Chapter 5 introduces two common search algorithms – depth first traversal and breadth first traversal. This chapter will tell you what the characteristics of the two kinds of search are and what problems are suitable for solving.
  • Chapter 6 will explain the dichotomy, including its basic form, problem-solving skills and algorithm template.
  • Chapter 7 is about bit operation, which aims to make readers think from the perspective of binary.
  • Chapter 8 is about design. Learning the content of this chapter requires readers to be familiar with common data structures.
  • Chapter 9 explains two common double pointers in detail.
  • Chapter 10 makes a detailed analysis of the classical algorithm – dynamic programming step by step, and introduces a spatial optimization method – rolling array.
  • Chapter 11 is about sliding windows. This algorithm uses two pointers to define the left and right boundaries of the window, and counts the information in the window. When the window slides, only the changing part of the window is considered to maximize the use of the existing operation results, so as to reduce the time complexity.
  • Chapter 12 is about game theory. The frequency of this kind of problems is also very high, and the problems related to stone games have appeared many times in leetcode. Although there is no fixed thinking method for game problems, there are also some rules to follow.
  • Chapter 13 deals with the stock problem, which belongs to the sub problem of dynamic programming. Readers are advised to read this chapter after reading Chapter 10 dynamic planning.
  • Chapters 14 and 15 are about the divide and conquer method and the greedy method respectively. These two topics are similar to dynamic planning. The upper limit of difficulty is very high and it is not easy to master. These two chapters start with several specific examples to help readers clarify the applicable scenarios and problem-solving strategies of greedy method and divide and conquer method.
  • Chapter 16 extends the content of Chapter 5 and introduces another common search algorithm backtracking method. What is backtracking? How to use backtracking method to solve specific algorithm problems? How to write the code of backtracking method? How to optimize the backtracking program? This chapter will tell you the answer.
  • Chapter 17 is the author’s selection of several interesting topics, which are shared with readers here.
  • Chapter 18 is some problem-solving templates, which is the refinement of the previous content. It is recommended that readers check the corresponding templates in this chapter after reading the corresponding topics. The significance of the template is to improve the speed of problem solving and reduce the error rate, rather than being used to copy mechanically, which readers should pay special attention to.
  • Chapter 19 provides as many solutions as possible to expand the reader’s thinking, which is different from the previous 18 chapters. In order not to affect reading, the previous 18 chapters explain a single knowledge point. At the same time, in order to match its content, sometimes they will give up the optimal solution and choose the solution matching the content of this chapter.
  • Chapter 20 shares some problem-solving skills that the author thinks are very good.

The new book will be shown here first. Next, I will answer some questions you are more concerned about in this book. Let’s enter the Q & a link!

Q&A

  • Q1: what programming language is this book?
  • A1: Python。 But I provided a supporting website. All the codes are providedJava,CPP,PythonThree kinds of code, so if you are not familiar with Python and only need Java or CPP, there is no problem at all. In addition, some topics also provide JS code. Later, we may add other languages according to readers’ feedback.

My

Website address of this book:https://leetcode-solution.cn/…

  • Q2: are the contents of the book the contents of GitHub warehouse and official account?
  • A2: many readers come from my GitHub, which also provides e-book versions.

My

GitHub address:https://github.com/azl3979858…

So will the content of GitHub’s e-book overlap with this book? The answer is almost no overlap. The content of this book is almost new and unpublished. You don’t have to worry about buying oneOpen source book

  • Q3: is this book suitable for Xiaobai?
  • A3: this book is specially designed for people who want to brush questions scientifically and efficiently. Reading this book is suitable for people who understand at least one programming language, can convert ideas into code, and understand common data structures. If you are such a person, you can buy it to read.
  • Q4: is the upper limit of this book high? I want to improve myself.
  • A4: the upper limit of this book is not high, and the difficulty basically covers the middle of the force buckleSimple, medium and partially difficult。 In other words, understanding this book can solve most of the problems. This level is not enough to cope with the algorithm competition, butDealing with an interview is enough

If you have any questions, you can leave me a message. I will try my best to answer your questions

Fan welfare

50% discount

At present, it is still in the pre-sale stage. I have won a wave of benefits for the readers of the official account. You can buy it at a more favorable price.

The price of the new book is 99 yuan, but I helped you get a 50% discount,49.5 yuanYou can take it. In addition, the first 10000 books will be accompanied by membership coupons with force buckles.

Friends who want to start now are very cost-effective. Scan the QR code below (or use this link)https://u.jd.com/gKbUGbR)You can buy it.

My

Free books

In addition, Li Kou and Jia Jia draw three fans for free! The follow-up meeting will draw prizes and send books on this number from time to time. You can pay attention to it!

Please read carefully the way of participation:

  1. On my official accountForce buckleIn the background, send the two words [lucky draw] (without any symbol or expression) to participate in the lucky draw.

Click the account above and reply to the [lucky draw] to participate

Remind me: it’s in the backstage of the official account, not in the comment area, the backstage of the account, or wechat.

  1. 12:00, September 9Automatic lottery, wechat will automatically notify after the lottery.
  2. The lottery will be conducted by a third-party platform. If you have any questions during the lottery and cashing process, please add the little secretary wechat (wechat: wxid_d5q3rgueie4r22)

In addition, the front end of the official account brain cave is also doing the same lottery. You can also participate in the lottery by replying to the lottery in the front end and background of the brain cave.Both numbers participated, and the winning rate doubled!

Recommended Today

Study day 6

C language Conditional operator ?;—— Ternary operator, unique ternary operator, (expression 1)? (expression 2); (expression 3); int a = 4, b = 5, max; /*max = (a > b)? a : b;*/———— This sentence can replace lines 3-6 if (a > b) max = a; else max = b; printf(“max=%d\n”, max); Switch statement switch case […]