File tree
232 files changed
+148372
-36354
lines changed- Acwing
- 1142.-繁忙的都市
- 895.-最长上升子序列
- 905.-区间选点
- 906.-区间分组
- 907.-区间覆盖
- 908.-最大不相交区间数量
- lca最小公共祖先
- topological-sort
- 算法基础课
- Books
- Design-Data-Intensive-Apps-Part-1
- binomial-coefficient
- fibonacci-squence
- harmonic-numbers
- lca
- max-flow
- minimal-spanning-tree
- shortest-path-problem
- Google Kick Start
- 2020-round-a
- 2020-round-b
- past-interview-minesweeper
- Interview
- Internet Protocol
- all-valid-permutations-of-parentheses
- array
- balanced-search-trees
- behavior-questions
- binary-search
- choose-k-cards-and-find-the-maximum
- count-array-count-inversion-of-an-array
- design-heap-or-priority-queue
- divide-two-integer
- dynamic-programming-1
- dynamic-programming-4
- final-java
- find-longest-substring-at-most-k-characters
- find-minimum-in-rotated-sorted-array
- first-non-repeating-character-in-stream
- graph
- greedy-algorithm
- gs
- hashmap
- k-sum-problem
- keep-distance-for-identical-elements
- knight-dialer
- kth-problem
- linked-list
- lowest-common-ancester
- majority-element-with-k-times
- math
- maximum-product-subarray
- midterm-java
- ood
- rectangle-2d-dp
- recursion-tree
- recursion
- russian-doll
- search-in-bitonic-array
- serializing-and-deserializing
- singleton
- sorting-algorithms
- stack-and-queue
- string-match
- string
- subset,-combination,-permutation-problems
- tree
- 午间课堂
- 每日打卡
- Java
- Serialization
- array,-class-and-objects
- common-problem
- comparison-with-other-languages
- control-flow-and-methods
- primitive-types-and-basic-operations
- tips
- Leetcode
- 10.-regular-expression-matching
- 1011.-Capacity-To-Ship-Packages-Within-D-Days
- 1014.-Best-Sightseeing-Pair
- 1015.-Smallest-Integer-Divisible-by-K
- 1020.-Number-of-Enclaves
- 1021.-Remove-Outermost-Parentheses
- 103.-binary-tree-zigzag-level-order-traversal
- 1041.-robot-bounded-in-circle
- 1047.-remove-all-adjacent-duplicates-in-string
- 1057.-campus-bikes
- 1074.-number-of-submatrices-that-sum-to-target
- 109.-convert-sorted-list-to-binary-search-tree
- 11.-container-with-most-water
- 112.-path-sum
- 113.-path-sum-II
- 114.-flatten-binary-tree-to-linked-list
- 115.-distinct-subsequences
- 116.-Populating-Next-Right-Pointers-in-Each-Node
- 12.-integer-to-roman
- 121,123,132,188,309,714-best-time-to-buy-and-sell-stock
- 1235.-maximum-profit-in-job-scheduling
- 1240.-Tiling-a-Rectangle-with-the-Fewest-Squares
- 1286.-iterator-for-combination
- 13.-roman-to-integer
- 130.-surrounded-regions
- 138.-copy-list-with-random-pointer
- 139.-word-break
- 1396.-design-underground-system
- 140.-word-break-ii
- 146.-lru-cache
- 148.-sort-list
- 149.-max-points-on-a-line
- 164.-Maximum-Gap
- 167.-Two-Sum-II-Input-Array-Is-Sorted
- 1675.-Minimize-Deviation-in-Array
- 169.-majority-element
- 174.-Dungeon-Game
- 189.-Rotate-Array
- 19.-Remove-Nth-Node-From-End-of-List
- 1995.-Count-Special-Quadruplets
- 1996.-The-Number-of-Weak-Characters-in-the-Game
- 2.-add-two-numbers
- 208.-implement-trie-(prefix-tree)
- 212.-word-search-ii
- 2141.-Maximum-Running-Time-of-N-Computers
- 222.-count-complete-tree-node
- 229.-majority-element-ii
- 239.-sliding-window-maximum
- 24.-Swap-Nodes-in-Pairs
- 253.-meeting-rooms-ii
- 254.-factor-combinations
- 274.-H-Index
- 283.-Move-Zeroes
- 287.-find-the-duplicate-number
- 290.-word-pattern
- 291.-word-pattern-II
- 295.-find-median-from-data-stream
- 299.-Bulls-and-Cows
- 3.-Longest-Substring-Without-Repeating-Characters
- 312.-Burst-Balloons
- 32.-longest-valid-parentheses
- 344.-Reverse-String
- 36.-valid-sudoku
- 376.-Wiggle-Subsequence
- 394.-decode-string
- 4.-median-of-two-sorted-arrays
- 402.-Remove-K-Digits
- 42.-trapping-rain-water
- 437.-path-sum-iii
- 438,-76,-3,-30,-sliding-window
- 46.-Permutations
- 496.-next-greater-element-i
- 520.-detect-capital
- 532.-k-diff-pairs-in-an-array
- 54.-spiral-matrix
- 542.-01-Matrix
- 557.-Reverse-Words-in-a-String-III
- 560.-Subarray-Sum-Equals-K
- 568.-maximum-vacation-days
- 58.-Length-of-Last-Word
- 617.-Merge-Two-Binary-Trees
- 636.-exclusive-time-of-functions
- 646.-maximum-length-of-pair-chain
- 647.-palindromic-substrings
- 684.-Redundant-Connection
- 69.-sqrt(x)
- 695.-Max-Area-of-Island
- 72.-edit-distance
- 723.-Candy-Crush
- 733.-Flood-Fill
- 754.-Reach-a-Number
- 815.-Bus-Routes
- 85.-maximal-rectangle
- 87.-scramble-string
- 876.-Middle-of-the-Linked-List
- 91.-decode-ways
- 93.-restore-ip-addresses
- 95.-unique-binary-search-trees-ii
- 952.-largest-component-size-by-common-factor
- 96.-unique-binary-search-trees
- 97.-interleaving-string
- 977.-Squares-of-a-Sorted-Array
- 987.-Vertical-Order-Traversal-of-a-binary-tree
- 99.-recover-binary-search-tree
- 994.-rotting-oranges
- dp-pattern
- LibreOJ
- 10000
- 10001
- 10002
- 10003
- Misc
- CSS
- rsa-en&decryption
- Operating System/cs124
- Python/Tips
- about
- assets
- javascripts
- lunr
- min
- workers
- stylesheets
- c
- functional-programming-with-futures-to-implement-quick-sort
- marcos-vs-functions
- misc
- overloading-operator
- smart-pointers
- stl-complexity
- golang
- Intro-To-Golang
- data-structure
- intro-learning-notes
- struct
- iOS
- exam-ii-review-part-one
- exam-ii-review-part-two
- ios-api
- some-tools
- machine learning
- coursera-ml-week1
- cs231n-lecture-3-loss-function
- cs231n-lecture-4-introduction-to-neural-networks
- cs231n-lecture-5-convolutional-neural-networks
- cs231n-lecture-6-training-neural-networks-i
- search
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
232 files changed
+148372
-36354
lines changedLarge diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
Large diffs are not rendered by default.
0 commit comments