增加经典题目

Author: diguage

docs/0000-01-modified-binary-search.adoc

@@ -14,7 +14,7 @@
 
 . xref:0215-kth-largest-element-in-an-array.adoc[215. Kth Largest Element in an Array]
 . xref:0324-wiggle-sort-ii.adoc[324. Wiggle Sort II]
-. xref:0347-top-k-frequent-elements.adoc[347. 前 K 个高频元素]
+. xref:0347-top-k-frequent-elements.adoc[347. Top K Frequent Elements]
 . xref:0973-k-closest-points-to-origin.adoc[973. K Closest Points to Origin]
 . xref:1738-find-kth-largest-xor-coordinate-value.adoc[1738. Find Kth Largest XOR Coordinate Value]
 . xref:1985-find-the-kth-largest-integer-in-the-array.adoc[1985. Find the Kth Largest Integer in the Array]

docs/0000-03-prefix-sum.adoc

@@ -53,17 +53,70 @@ for (int i = 1; i < nums.length; i++) {
 
 . xref:0042-trapping-rain-water.adoc[42. Trapping Rain Water] -- 这个单调栈，在中间过程加了一些操作，有意思。
 . xref:0084-largest-rectangle-in-histogram.adoc[84. Largest Rectangle in Histogram]
+. xref:0085-maximal-rectangle.adoc[85. Maximal Rectangle]
 . xref:0155-min-stack.adoc[155. Min Stack] -- 这个辅助栈也可以认为是一种单调栈。
-. xref:0239-sliding-window-maximum.adoc[239. Sliding Window Maximum]
+. xref:0255-verify-preorder-sequence-in-binary-search-tree.adoc[255. Verify Preorder Sequence in Binary Search Tree]
 . xref:0316-remove-duplicate-letters.adoc[316. Remove Duplicate Letters]
+. xref:0321-create-maximum-number.adoc[321. Create Maximum Number]
 . xref:0402-remove-k-digits.adoc[402. Remove K Digits]
+. xref:0456-132-pattern.adoc[456. 132 Pattern]
 . xref:0496-next-greater-element-i.adoc[496. Next Greater Element I]
 . xref:0503-next-greater-element-ii.adoc[503. Next Greater Element II]
 . xref:0581-shortest-unsorted-continuous-subarray.adoc[581. Shortest Unsorted Continuous Subarray]
 . xref:0654-maximum-binary-tree.adoc[654. Maximum Binary Tree]
 . xref:0739-daily-temperatures.adoc[739. Daily Temperatures]
-. xref:0901-online-stock-span.adoc[901. Online Stock Span]
 . xref:0768-max-chunks-to-make-sorted-ii.adoc[768. Max Chunks To Make Sorted II]
+. xref:0769-max-chunks-to-make-sorted.adoc[769. Max Chunks To Make Sorted]
+. xref:0853-car-fleet.adoc[853. Car Fleet]
+. xref:0901-online-stock-span.adoc[901. Online Stock Span]
+. xref:0907-sum-of-subarray-minimums.adoc[907. Sum of Subarray Minimums]
+. xref:0962-maximum-width-ramp.adoc[962. Maximum Width Ramp]
+. xref:0975-odd-even-jump.adoc[975. Odd Even Jump]
+. xref:1008-construct-binary-search-tree-from-preorder-traversal.adoc[1008. Construct Binary Search Tree from Preorder Traversal]
+. xref:1019-next-greater-node-in-linked-list.adoc[1019. Next Greater Node In Linked List]
+. xref:1063-number-of-valid-subarrays.adoc[1063. Number of Valid Subarrays]
+. xref:1081-smallest-subsequence-of-distinct-characters.adoc[1081. Smallest Subsequence of Distinct Characters]
+. xref:1124-longest-well-performing-interval.adoc[1124. Longest Well-Performing Interval]
+. xref:1130-minimum-cost-tree-from-leaf-values.adoc[1130. Minimum Cost Tree From Leaf Values]
+. xref:1475-final-prices-with-a-special-discount-in-a-shop.adoc[1475. Final Prices With a Special Discount in a Shop]
+. xref:1504-count-submatrices-with-all-ones.adoc[1504. Count Submatrices With All Ones]
+. xref:1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.adoc[1526. Minimum Number of Increments on Subarrays to Form a Target Array]
+. xref:1574-shortest-subarray-to-be-removed-to-make-array-sorted.adoc[1574. Shortest Subarray to be Removed to Make Array Sorted]
+. xref:1673-find-the-most-competitive-subsequence.adoc[1673. Find the Most Competitive Subsequence]
+. xref:1762-buildings-with-an-ocean-view.adoc[1762. Buildings With an Ocean View]
+. xref:1776-car-fleet-ii.adoc[1776. Car Fleet II]
+. xref:1793-maximum-score-of-a-good-subarray.adoc[1793. Maximum Score of a Good Subarray]
+. xref:1856-maximum-subarray-min-product.adoc[1856. Maximum Subarray Min-Product]
+. xref:1944-number-of-visible-people-in-a-queue.adoc[1944. Number of Visible People in a Queue]
+. xref:1950-maximum-of-minimum-values-in-all-subarrays.adoc[1950. Maximum of Minimum Values in All Subarrays]
+. xref:1996-the-number-of-weak-characters-in-the-game.adoc[1996. The Number of Weak Characters in the Game]
+. xref:2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.adoc[2030. Smallest K-Length Subsequence With Occurrences of a Letter]
+. xref:2104-sum-of-subarray-ranges.adoc[2104. Sum of Subarray Ranges]
+. xref:2281-sum-of-total-strength-of-wizards.adoc[2281. Sum of Total Strength of Wizards]
+. xref:2282-number-of-people-that-can-be-seen-in-a-grid.adoc[2282. Number of People That Can Be Seen in a Grid]
+. xref:2289-steps-to-make-array-non-decreasing.adoc[2289. Steps to Make Array Non-decreasing]
+. xref:2297-jump-game-viii.adoc[2297. Jump Game VIII]
+. xref:2334-subarray-with-elements-greater-than-varying-threshold.adoc[2334. Subarray With Elements Greater Than Varying Threshold]
+. xref:2345-finding-the-number-of-visible-mountains.adoc[2345. Finding the Number of Visible Mountains]
+. xref:2355-maximum-number-of-books-you-can-take.adoc[2355. Maximum Number of Books You Can Take]
+. xref:2454-next-greater-element-iv.adoc[2454. Next Greater Element IV]
+. xref:2487-remove-nodes-from-linked-list.adoc[2487. Remove Nodes From Linked List]
+. xref:2617-minimum-number-of-visited-cells-in-a-grid.adoc[2617. Minimum Number of Visited Cells in a Grid]
+. xref:2736-maximum-sum-queries.adoc[2736. Maximum Sum Queries]
+. xref:2818-apply-operations-to-maximize-score.adoc[2818. Apply Operations to Maximize Score]
+. xref:2832-maximal-range-that-each-element-is-maximum-in-it.adoc[2832. Maximal Range That Each Element Is Maximum in It]
+. xref:2863-maximum-length-of-semi-decreasing-subarrays.adoc[2863. Maximum Length of Semi-Decreasing Subarrays]
+. xref:2865-beautiful-towers-i.adoc[2865. Beautiful Towers I]
+. xref:2866-beautiful-towers-ii.adoc[2866. Beautiful Towers II]
+. xref:2940-find-building-where-alice-and-bob-can-meet.adoc[2940. Find Building Where Alice and Bob Can Meet]
+. xref:2945-find-maximum-non-decreasing-array-length.adoc[2945. Find Maximum Non-decreasing Array Length]
+. xref:3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum.adoc[3113. Find the Number of Subarrays Where Boundary Elements Are Maximum]
+. xref:3205-maximum-array-hopping-score-i.adoc[3205. Maximum Array Hopping Score I]
+. xref:3221-maximum-array-hopping-score-ii.adoc[3221. Maximum Array Hopping Score II]
+. xref:3229-minimum-operations-to-make-array-equal-to-target.adoc[3229. Minimum Operations to Make Array Equal to Target]
+. xref:3359-find-sorted-submatrices-with-maximum-element-at-most-k.adoc[3359. Find Sorted Submatrices With Maximum Element at Most K]
+. xref:3420-count-non-decreasing-subarrays-after-k-operations.adoc[3420. Count Non-Decreasing Subarrays After K Operations]
+. xref:3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays.adoc[3430. Maximum and Minimum Sums of at Most Size K Subarrays]
 
 
 == 参考资料