摘要：
Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required. Exampl 阅读全文
阅读排行榜
Prefix Sum & Dictionary Time and Space O(n) for -- Find a number of continuous subarrays/submatrices/tree paths that sum to target
2021-06-18 20:31 by Johnson_强生仔仔, 56 阅读, 收藏,
摘要：
Prefix sum, 参考这个solution, 讲解的很清楚。 . What is prefix sum Prefix sum is a sum of the current value with all previous elements starting from the beginning 阅读全文
[LeetCode] 642. Design Search Autocomplete System_Hard tag: Trie
2021-06-30 00:03 by Johnson_强生仔仔, 54 阅读, 收藏,
摘要：
Design a search autocomplete system for a search engine. Users may input a sentence (at least one word and end with a special character '#'). You are 阅读全文
[LeetCode] 428. Serialize and Deserialize N-ary Tree_hard tag: DFS, Divide and Conquer
2021-07-29 22:39 by Johnson_强生仔仔, 53 阅读, 收藏,
摘要：
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文
[LeetCode] 79. Word Search_Medium tag: Backtracking, DFS
2021-07-28 11:04 by Johnson_强生仔仔, 53 阅读, 收藏,
摘要：
Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequent 阅读全文
浙公网安备 33010602011771号