Summer heat wave, Java brush topic hot in the middle of the activity view: juejin.cn/post/696207… Let’s take a look at which authors have made the shortlist from 19th to 22nd
| The author | High quality articles |
|---|---|
| Sad pig intestines | LeetCode sword offers 58-1 flip word sequence [4] | Java clock in brush |
| Miyazui Mitsuha’s brush question diary | Tree traversal: Iteration & Recursion | Java brush problem clocking |
| I know you know all about u | How can I query the data in the last 10 minutes |
| zxhtom | Four ways to take you through step-by-step dissection algorithms – Hash tables are not necessarily good for finding duplicate data |
| zxhtom | 30S animation brings you a thorough understanding of recursion solutions within the range of linked list inversion,100% execution speed | Java brush problem clocking |
| HQ digital card | The importance of employees LeetCode 】 【 Java antithesis | Java clock in brush |
| Village, the rain away | What are time complexity and space complexity? | Java brush title punch card |
| zxhtom | Calculate the number of prime numbers in the range, as far as possible to avoid the number of cycles | Java brush problem punch card |
| Sad pig intestines | LeetCode reverse string [3] | 344 Java clock in brush |
| Gxin | JVM class loading mechanism | Java brush problem punch card |
| zxhtom | Change the idea of iterative method to solve the local inversion problem (found a major bug in Leetcode) | Java brush problem card |
| I know you know all about u | HashMap (JDK7 vs. JDK8 |
| Learned? | 421. Most of the two Numbers in an array or a value (medium) | Java clock in brush |
| Wandering about steamed fish | Dynamic planning – Dungeon game | Java brush title punch card |
| xcbeyond | Sort algorithm bubble sort | Java brush title punch card |
| Miyazui Mitsuha’s brush question diary | Compared to the topic more meaningful actual combat skills | Java brush title punch card |
| Close the aunt | Close auntie takes you through the LeetCode series of Remove Elements | Java brush questions punch card |
| Miyazui Mitsuha’s brush question diary | Why can be converted into “sequence DP” problem solving | Java brush problem punch card |
| Miyazui Mitsuha’s brush question diary | Use “prefix xor” & “hash table” to speed up the search |
| Miyazui Mitsuha’s brush question diary | How to use “greedy” and “Trie” to find “maximum xOR result” |
| Sad pig intestines | LeetCode sword refers to offer 67 change the string to an integer (medium) | Java clock in brush |
| Miyazui Mitsuha’s brush question diary | Application of “game theory” analysis of the “first hand must win” sequence has what kind of nature |
| Miyazui Mitsuha’s brush question diary | Detail using “two dimensional prefix xor” & “priority queue (heap)” for solving | Java brush problem punched card |
| Miyazui Mitsuha’s brush question diary | Detail linear DP solution, and two “optimizable” points | Java brush problem punch card |
| Miyazui Mitsuha’s brush question diary | Use “dichotomy” to find the segmentation point, and how to determine the “dichotomy range” | Java brush question punch |
| Miyazui Mitsuha’s brush question diary | Classic graph theory minimum spanning tree problem | Java brush problem punch card |
| HQ digital card | 【LeetCode】 decoding method Java problem solving | Java brush problem punch card |
| Miyazui Mitsuha’s brush question diary | Various solutions to graphic classic problems: “hash table” & “digit statistics” & “DFA” | Java brush problem punching |
| Close the aunt | Close auntie takes you through the LeetCode series of the best time to buy and sell stocks | Java brush title punch card |