一刷895

Author: diguage

README.adoc

@@ -6289,14 +6289,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0894-all-possible-full-binary-trees.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/maximum-frequency-stack/[895. Maximum Frequency Stack^]
-//|{source_base_url}/_0895_MaximumFrequencyStack.java[Java]
-//|{doc_base_url}/0895-maximum-frequency-stack.adoc[题解]
-//|Hard
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/maximum-frequency-stack/[895. Maximum Frequency Stack^]
+|{source_base_url}/_0895_MaximumFrequencyStack.java[Java]
+|{doc_base_url}/0895-maximum-frequency-stack.adoc[题解]
+|Hard
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/monotonic-array/[896. Monotonic Array^]
 //|{source_base_url}/_0896_MonotonicArray.java[Java]

docs/0895-maximum-frequency-stack.adoc

@@ -1,68 +1,97 @@
 [#0895-maximum-frequency-stack]
-= 895. Maximum Frequency Stack
+= 895. 最大频率栈
 
-{leetcode}/problems/maximum-frequency-stack/[LeetCode - Maximum Frequency Stack^]
+https://leetcode.cn/problems/maximum-frequency-stack/[LeetCode - 895. 最大频率栈^]
 
-Implement `FreqStack`, a class which simulates the operation of a stack-like data structure.
+设计一个类似堆栈的数据结构，将元素推入堆栈，并从堆栈中弹出**出现频率**最高的元素。
 
-`FreqStack` has two functions:
+实现 `FreqStack` 类:
 
+* `FreqStack()` 构造一个空的堆栈。
+* `void push(int val)` 将一个整数 `val` 压入栈顶。
+* `int pop()` 删除并返回堆栈中出现频率最高的元素。
+** 如果出现频率最高的元素不只一个，则移除并返回最接近栈顶的元素。
 
-* `push(int x)`, which pushes an integer `x` onto the stack.
-* `pop()`, which *removes* and returns the most frequent element in the stack.
-	
-	* If there is a tie for most frequent element, the element closest to the top of the stack is removed and returned.
-	
-	
+*示例 1：*
 
+....
+输入：
+["FreqStack","push","push","push","push","push","push","pop","pop","pop","pop"],
+[[],[5],[7],[5],[7],[4],[5],[],[],[],[]]
+输出：[null,null,null,null,null,null,null,5,7,5,4]
+解释：
+FreqStack = new FreqStack();
+freqStack.push (5);//堆栈为 [5]
+freqStack.push (7);//堆栈是 [5,7]
+freqStack.push (5);//堆栈是 [5,7,5]
+freqStack.push (7);//堆栈是 [5,7,5,7]
+freqStack.push (4);//堆栈是 [5,7,5,7,4]
+freqStack.push (5);//堆栈是 [5,7,5,7,4,5]
+freqStack.pop ();//返回 5 ，因为 5 出现频率最高。堆栈变成 [5,7,5,7,4]。
+freqStack.pop ();//返回 7 ，因为 5 和 7 出现频率最高，但7最接近顶部。堆栈变成 [5,7,5,4]。
+freqStack.pop ();//返回 5 ，因为 5 出现频率最高。堆栈变成 [5,7,4]。
+freqStack.pop ();//返回 4 ，因为 4, 5 和 7 出现频率最高，但 4 是最接近顶部的。堆栈变成 [5,7]。
+....
 
- 
+*提示：*
 
-*Example 1:*
+* `0 \<= val \<= 10^9^`
+* `push` 和 `pop` 的操作数不大于 `2 * 10^4^`。
+* 输入保证在调用 `pop` 之前堆栈中至少有一个元素。
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:*
- ["FreqStack","push","push","push","push","push","push","pop","pop","pop","pop"],
- [[],[5],[7],[5],[7],[4],[5],[],[],[],[]]
-*Output:* [null,null,null,null,null,null,null,5,7,5,4]
-*Explanation:*
-After making six .push operations, the stack is [5,7,5,7,4,5] from bottom to top.  Then:
-
-pop() -> returns 5, as 5 is the most frequent.
-The stack becomes [5,7,5,7,4].
 
-pop() -> returns 7, as 5 and 7 is the most frequent, but 7 is closest to the top.
-The stack becomes [5,7,5,4].
+== 思路分析
 
-pop() -> returns 5.
-The stack becomes [5,7,4].
+只想到使用哈希记录出现次数，没想到可以根据出现次数去建立多个栈。
 
-pop() -> returns 4.
-The stack becomes [5,7].
-----
+image::images/0895-10.png[{image_attr}]
 
- 
+image::images/0895-11.png[{image_attr}]
 
-*Note:*
+image::images/0895-12.png[{image_attr}]
 
+image::images/0895-13.png[{image_attr}]
 
-* Calls to `FreqStack.push(int x)` will be such that `0 <= x <= 10^9`.
-* It is guaranteed that `FreqStack.pop()` won't be called if the stack has zero elements.
-* The total number of `FreqStack.push` calls will not exceed `10000` in a single test case.
-* The total number of `FreqStack.pop` calls will not exceed `10000` in a single test case.
-* The total number of `FreqStack.push` and `FreqStack.pop` calls will not exceed `150000` across all test cases.
+image::images/0895-14.png[{image_attr}]
 
+image::images/0895-15.png[{image_attr}]
 
+image::images/0895-16.png[{image_attr}]
 
- 
+image::images/0895-17.png[{image_attr}]
 
+image::images/0895-18.png[{image_attr}]
 
+image::images/0895-19.png[{image_attr}]
 
+image::images/0895-10.png[{image_attr}]
 
 [[src-0895]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0895_MaximumFrequencyStack.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0895_MaximumFrequencyStack_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
+
 
+. https://leetcode.cn/problems/maximum-frequency-stack/solutions/1998430/mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-oich/[895. 最大频率栈 - 【动画】没想明白？一个动画秒懂！^]
+. https://leetcode.cn/problems/maximum-frequency-stack/solutions/1997251/zui-da-pin-lu-zhan-by-leetcode-solution-moay/[895. 最大频率栈 - 官方题解^]
+. https://leetcode.cn/problems/maximum-frequency-stack/solutions/1998468/-by-muse-77-bzg6/[895. 最大频率栈 - 图解LeetCode^]