fd

Author: liwentian

.DS_Store

@@ -346,6 +346,7 @@
 |449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SerializeAndDeserializeBST.java)|90|和#297一样|
 |450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/DeleteNodeInBST.java)|60|这题非常经典，值得多做十遍|
 |477|[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/TotalHammingDistance.java)||
+|480|[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SlidingWindowMedian.java)|70||
 |482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LicenseKeyFormatting.java)|90||
 |485|[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MaxConsecutiveOnes.java)|100||
 |487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MaxConsecutiveOnesII.java)|80||

README.md

@@ -96,4 +96,6 @@ return -1;
 不能直接写return o1 > o2 ? 1 : -1；
 因为可能存在重复的数，在TreeMap中查找key时通过comparator等于0，上述写法导致永远找不到key。
 
-三十，StringBuilder的insert(0, c)不要频繁调用，不如append，最后reverse。
+三十，StringBuilder的insert(0, c)不要频繁调用，不如append，最后reverse。
+
+三十一，List在allAll一个PriorityQueue时，是不会带顺序的，正确的做法是while(!queue.isEmpty()) {list.add(queue.poll());}

doc/Attention.md

@@ -32,13 +32,13 @@
 \@writefile{toc}{\contentsline {section}{\numberline {1.9}Merge Two Sorted Lists}{9}{section.1.9}}
 \@writefile{toc}{\contentsline {subsubsection}{Description}{9}{section*.19}}
 \@writefile{toc}{\contentsline {subsubsection}{Solution}{9}{section*.20}}
-\@writefile{toc}{\contentsline {section}{\numberline {1.10}Intersection of Two Linked Lists}{10}{section.1.10}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.10}Merge k Sorted Lists}{10}{section.1.10}}
 \@writefile{toc}{\contentsline {subsubsection}{Description}{10}{section*.21}}
 \@writefile{toc}{\contentsline {subsubsection}{Solution}{10}{section*.22}}
-\@writefile{toc}{\contentsline {section}{\numberline {1.11}Copy List with Random Pointer}{11}{section.1.11}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.11}Intersection of Two Linked Lists}{11}{section.1.11}}
 \@writefile{toc}{\contentsline {subsubsection}{Description}{11}{section*.23}}
 \@writefile{toc}{\contentsline {subsubsection}{Solution}{11}{section*.24}}
-\@writefile{toc}{\contentsline {section}{\numberline {1.12}Merge k Sorted Lists}{12}{section.1.12}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.12}Copy List with Random Pointer}{12}{section.1.12}}
 \@writefile{toc}{\contentsline {subsubsection}{Description}{12}{section*.25}}
 \@writefile{toc}{\contentsline {subsubsection}{Solution}{12}{section*.26}}
 \@writefile{toc}{\contentsline {section}{\numberline {1.13}Palindrome Linked List}{13}{section.1.13}}
@@ -80,8 +80,44 @@
 \@writefile{toc}{\contentsline {section}{\numberline {1.25}Plus One Linked List}{25}{section.1.25}}
 \@writefile{toc}{\contentsline {subsubsection}{Description}{25}{section*.51}}
 \@writefile{toc}{\contentsline {subsubsection}{Solution}{25}{section*.52}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.26}Min Stack}{26}{section.1.26}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{26}{section*.53}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{26}{section*.54}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.27}Evaluate Reverse Polish Notation}{27}{section.1.27}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{27}{section*.55}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{27}{section*.56}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.28}Basic Calculator}{28}{section.1.28}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{28}{section*.57}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{28}{section*.58}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.29}Remove Duplicate Letters}{29}{section.1.29}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{29}{section*.59}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{29}{section*.60}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.30}Implement Queue using Stacks}{30}{section.1.30}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{30}{section*.61}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{30}{section*.62}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.31}Flatten Nested List Iterator}{32}{section.1.31}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{32}{section*.63}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{32}{section*.64}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.32}Implement Stack using Queues}{33}{section.1.32}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{33}{section*.65}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{33}{section*.66}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.33}The Skyline Problem}{34}{section.1.33}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{34}{section*.67}}
+\@writefile{toc}{\contentsline {subsubsection}{Analysis}{34}{section*.68}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution I}{35}{section*.69}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution II}{36}{section*.70}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.34}Top K Frequent Elements}{37}{section.1.34}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{37}{section*.71}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution I}{37}{section*.72}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution II}{38}{section*.73}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.35}Find Median from Data Stream}{39}{section.1.35}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{39}{section*.74}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{39}{section*.75}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.36}Title}{40}{section.1.36}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{40}{section*.76}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{40}{section*.77}}
 \@setckpt{List}{
-\setcounter{page}{26}
+\setcounter{page}{41}
 \setcounter{equation}{0}
 \setcounter{enumi}{0}
 \setcounter{enumii}{0}
@@ -91,20 +127,20 @@
 \setcounter{mpfootnote}{0}
 \setcounter{part}{0}
 \setcounter{chapter}{1}
-\setcounter{section}{25}
+\setcounter{section}{36}
 \setcounter{subsection}{0}
 \setcounter{subsubsection}{0}
 \setcounter{paragraph}{0}
 \setcounter{subparagraph}{0}
 \setcounter{figure}{0}
 \setcounter{table}{0}
-\setcounter{FancyVerbLine}{22}
+\setcounter{FancyVerbLine}{1}
 \setcounter{pp@next@reset}{1}
 \setcounter{@fnserial}{0}
 \setcounter{Item}{0}
 \setcounter{Hfootnote}{0}
 \setcounter{Hy@AnnotLevel}{0}
-\setcounter{bookmark@seq@number}{26}
+\setcounter{bookmark@seq@number}{37}
 \setcounter{parentequation}{0}
 \setcounter{section@level}{3}
 }