https://books.halfrost.com/leetcode/en/ChapterOne/Recent content in Chapter 1 Prologue on LeetCode CookbookHugo -- gohugo.ioen-UShttps://books.halfrost.com/leetcode/en/ChapterOne/Data_Structure/Mon, 01 Jan 0001 00:00:00 +0000https://books.halfrost.com/leetcode/en/ChapterOne/Data_Structure/Data Structure Knowledge # The following is data-structure-related knowledge compiled by the author. I hope to enumerate all common data structures as exhaustively as possible. If there are any omissions, everyone is welcome to enlighten me and submit a PR. Related problems are still being gradually organized, and explanatory articles are still being written. Solving problems is only a means to improve algorithmic ability; the ultimate goal should be to improve one’s own thinking ability.https://books.halfrost.com/leetcode/en/ChapterOne/Algorithm/Mon, 01 Jan 0001 00:00:00 +0000https://books.halfrost.com/leetcode/en/ChapterOne/Algorithm/Algorithm Knowledge # The following is algorithm-related knowledge compiled by the author. I hope to enumerate all common algorithms exhaustively. If anything is missing, everyone is welcome to give advice and submit PRs. Related problems are still being gradually organized, and explanatory articles are still being created. Solving problems is only a means to improve algorithmic ability; the ultimate goal should be to improve one’s thinking ability. Knowledge needs to be condensed into blocks, so summarize these in the two sections of Chapter 1 and let it be sublimated~ I hope readers will come back to look at this table after finishing problem practice, so they can clearly organize their own knowledge system, check for gaps, and improve it as soon as possible.https://books.halfrost.com/leetcode/en/ChapterOne/Time_Complexity/Mon, 01 Jan 0001 00:00:00 +0000https://books.halfrost.com/leetcode/en/ChapterOne/Time_Complexity/Time Complexity and Space Complexity # I. Data Scale for Time Complexity # Data scale of problems that can be solved within 1s: 10^6 ~ 10^7 An O(n^2) algorithm can handle data at the 10^4 level (conservative estimate; handling problems at the 1000 level is definitely fine) An O(n) algorithm can handle data at the 10^8 level (conservative estimate; handling problems at the 10^7 level is definitely fine) An O(nlog n) algorithm can handle data at the 10^7 level (conservative estimate; handling problems at the 10^6 level is definitely fine) Data Scale Time Complexity Algorithm Examples 1 10 O(n!