From be81e88e955af46e704af21d271d1b85307052d3 Mon Sep 17 00:00:00 2001
From: 3000ye <hcg2924239214@163.com>
Date: Sat, 9 Mar 2024 07:54:54 +0000
Subject: [PATCH] update pages

---
 index.html | 323 ++++++++++++++++++++++++++++++++++++++++++++++++++++-
 index.xml  |   2 +-
 2 files changed, 322 insertions(+), 3 deletions(-)
diff --git a/index.html b/index.html
index b33071d..8ca0b05 100644
--- a/index.html
+++ b/index.html
@@ -1,7 +1,7 @@
 <!DOCTYPE html>
 <html lang="en">
   <head>
-	<meta name="generator" content="Hugo 0.123.7">
+	<meta name="generator" content="Hugo 0.123.8">
     <meta charset="utf-8" />
     <meta content="IE=edge,chrome=1" http-equiv="X-UA-Compatible" />
     <meta
@@ -93,7 +93,7 @@
     id="toc"
     class="toc-list-h1"
     x-data="tocController"
-    x-init="load([{&#34;id&#34;:&#34;linked-list&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;id&#34;:&#34;21-merge-two-sorted-lists&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;21. Merge Two Sorted Lists&#34;},{&#34;id&#34;:&#34;83-remove-duplicates-from-sorted-list&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-3&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;83. Remove Duplicates from Sorted List&#34;},{&#34;id&#34;:&#34;141-linked-list-cycle&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-4&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-5&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;141. Linked List Cycle&#34;},{&#34;id&#34;:&#34;160-intersection-of-two-linked-lists&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-6&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-7&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;160. Intersection of Two Linked Lists&#34;},{&#34;id&#34;:&#34;203-remove-linked-list-elements&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-8&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-9&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;203. Remove Linked List Elements&#34;}],&#34;title&#34;:&#34;Linked List&#34;},{&#34;id&#34;:&#34;stack&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;id&#34;:&#34;20-valid-parentheses&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-10&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-1-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;20. Valid Parentheses&#34;},{&#34;id&#34;:&#34;225-implement-stack-using-queues&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-2-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-3-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;225. Implement Stack using Queues&#34;},{&#34;id&#34;:&#34;496-next-greater-element-i&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-4-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-5-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;496. Next Greater Element I&#34;},{&#34;id&#34;:&#34;682-baseball-game&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-6-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-7-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;682. Baseball Game&#34;},{&#34;id&#34;:&#34;844-backspace-string-compare&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-8-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-9-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;844. Backspace String Compare&#34;},{&#34;id&#34;:&#34;1021-remove-outermost-parentheses&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-10-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-11&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1021. Remove Outermost Parentheses&#34;},{&#34;id&#34;:&#34;1047-remove-all-adjacent-duplicates-in-string&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-12&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-13&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1047. Remove All Adjacent Duplicates In String&#34;},{&#34;id&#34;:&#34;1475-final-prices-with-a-special-discount-in-a-shop&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-14&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-15&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1475. Final Prices With a Special Discount in a Shop&#34;},{&#34;id&#34;:&#34;1544-make-the-string-great&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-16&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-17&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1544. Make The String Great&#34;},{&#34;id&#34;:&#34;1598-crawler-log-folder&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-18&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-19&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1598. Crawler Log Folder&#34;},{&#34;id&#34;:&#34;1614-maximum-nesting-depth-of-the-parentheses&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-20&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-21&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1614. Maximum Nesting Depth of the Parentheses&#34;},{&#34;id&#34;:&#34;1700-number-of-students-unable-to-eat-lunch&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-22&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-23&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1700. Number of Students Unable to Eat Lunch&#34;},{&#34;id&#34;:&#34;2696-minimum-string-length-after-removing-substrings&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-24&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-25&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;2696. Minimum String Length After Removing Substrings&#34;}],&#34;title&#34;:&#34;Stack&#34;},{&#34;id&#34;:&#34;queue&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;sub&#34;:[]}],&#34;title&#34;:&#34;Queue&#34;}])"
+    x-init="load([{&#34;id&#34;:&#34;linked-list&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;id&#34;:&#34;21-merge-two-sorted-lists&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;21. Merge Two Sorted Lists&#34;},{&#34;id&#34;:&#34;83-remove-duplicates-from-sorted-list&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-3&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;83. Remove Duplicates from Sorted List&#34;},{&#34;id&#34;:&#34;141-linked-list-cycle&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-4&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-5&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;141. Linked List Cycle&#34;},{&#34;id&#34;:&#34;160-intersection-of-two-linked-lists&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-6&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-7&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;160. Intersection of Two Linked Lists&#34;},{&#34;id&#34;:&#34;203-remove-linked-list-elements&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-8&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-9&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;203. Remove Linked List Elements&#34;}],&#34;title&#34;:&#34;Linked List&#34;},{&#34;id&#34;:&#34;stack&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;id&#34;:&#34;20-valid-parentheses&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-10&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-1-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;20. Valid Parentheses&#34;},{&#34;id&#34;:&#34;225-implement-stack-using-queues&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-2-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-3-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;225. Implement Stack using Queues&#34;},{&#34;id&#34;:&#34;496-next-greater-element-i&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-4-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-5-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;496. Next Greater Element I&#34;},{&#34;id&#34;:&#34;682-baseball-game&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-6-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-7-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;682. Baseball Game&#34;},{&#34;id&#34;:&#34;844-backspace-string-compare&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-8-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-9-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;844. Backspace String Compare&#34;},{&#34;id&#34;:&#34;1021-remove-outermost-parentheses&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-10-1&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-11&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1021. Remove Outermost Parentheses&#34;},{&#34;id&#34;:&#34;1047-remove-all-adjacent-duplicates-in-string&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-12&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-13&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1047. Remove All Adjacent Duplicates In String&#34;},{&#34;id&#34;:&#34;1475-final-prices-with-a-special-discount-in-a-shop&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-14&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-15&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1475. Final Prices With a Special Discount in a Shop&#34;},{&#34;id&#34;:&#34;1544-make-the-string-great&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-16&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-17&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1544. Make The String Great&#34;},{&#34;id&#34;:&#34;1598-crawler-log-folder&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-18&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-19&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1598. Crawler Log Folder&#34;},{&#34;id&#34;:&#34;1614-maximum-nesting-depth-of-the-parentheses&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-20&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-21&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1614. Maximum Nesting Depth of the Parentheses&#34;},{&#34;id&#34;:&#34;1700-number-of-students-unable-to-eat-lunch&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-22&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-23&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;1700. Number of Students Unable to Eat Lunch&#34;},{&#34;id&#34;:&#34;2696-minimum-string-length-after-removing-substrings&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-24&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-25&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;2696. Minimum String Length After Removing Substrings&#34;}],&#34;title&#34;:&#34;Stack&#34;},{&#34;id&#34;:&#34;queue&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;id&#34;:&#34;387-first-unique-character-in-a-string&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-10&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-1-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;387. First Unique Character in a String&#34;}],&#34;title&#34;:&#34;Queue&#34;},{&#34;id&#34;:&#34;933-number-of-recent-calls&#34;,&#34;level&#34;:1,&#34;sub&#34;:[{&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-2-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-3-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}]},{&#34;id&#34;:&#34;2073-time-needed-to-buy-tickets&#34;,&#34;level&#34;:2,&#34;sub&#34;:[{&#34;id&#34;:&#34;heading-4-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题面&#34;},{&#34;id&#34;:&#34;heading-5-2&#34;,&#34;level&#34;:3,&#34;title&#34;:&#34;题解&#34;}],&#34;title&#34;:&#34;2073. Time Needed to Buy Tickets&#34;}],&#34;title&#34;:&#34;933. Number of Recent Calls&#34;}])"
     @scroll.window="onScroll()">
     
     <template x-for="row in rows">
@@ -1581,6 +1581,325 @@ <h3 id="heading-25">题解</h3>
 
 <h1 id="queue">Queue</h1>
 
+
+
+
+  
+
+
+
+<h2 id="387-first-unique-character-in-a-string">387. First Unique Character in a String</h2>
+<div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"><code class="language-cpp" data-lang="cpp"><span style="display:flex;"><span><span style="color:#66d9ef">class</span> <span style="color:#a6e22e">Solution</span> {
+</span></span><span style="display:flex;"><span><span style="color:#66d9ef">public</span><span style="color:#f92672">:</span>
+</span></span><span style="display:flex;"><span>    <span style="color:#66d9ef">int</span> firstUniqChar(string s) {
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">int</span> ls[<span style="color:#ae81ff">200</span>];
+</span></span><span style="display:flex;"><span>
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">for</span> (<span style="color:#66d9ef">auto</span> c : s) { ls[c] <span style="color:#f92672">++</span>; }
+</span></span><span style="display:flex;"><span>
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">for</span> (<span style="color:#66d9ef">int</span> i <span style="color:#f92672">=</span> <span style="color:#ae81ff">0</span>, l <span style="color:#f92672">=</span> s.size(); i <span style="color:#f92672">&lt;</span> l; i <span style="color:#f92672">++</span>) {
+</span></span><span style="display:flex;"><span>            <span style="color:#66d9ef">if</span> (ls[s[i]] <span style="color:#f92672">==</span> <span style="color:#ae81ff">1</span>) <span style="color:#66d9ef">return</span> i;
+</span></span><span style="display:flex;"><span>        }
+</span></span><span style="display:flex;"><span>
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">return</span> <span style="color:#f92672">-</span><span style="color:#ae81ff">1</span>;
+</span></span><span style="display:flex;"><span>    }
+</span></span><span style="display:flex;"><span>};
+</span></span></code></pre></div>
+
+
+
+  
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+        
+      
+    
+  
+
+
+
+<h3 id="heading-10">题面</h3>
+<p>给定一个字符串 <code>s</code> ，找到 <em>它的第一个不重复的字符，并返回它的索引</em> 。如果不存在，则返回 <code>-1</code> 。</p>
+
+
+
+
+  
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+  
+
+
+
+<h3 id="heading-1-2">题解</h3>
+<p><strong>Method One</strong>: 直接法</p>
+<ul>
+<li>用一个数组记录每个字符出现的次数</li>
+<li>遍历字符串，找到第一个只出现一次的字符</li>
+</ul>
+
+
+
+
+  
+
+
+
+<h1 id="933-number-of-recent-calls">933. Number of Recent Calls</h1>
+<div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"><code class="language-cpp" data-lang="cpp"><span style="display:flex;"><span><span style="color:#66d9ef">class</span> <span style="color:#a6e22e">RecentCounter</span> {
+</span></span><span style="display:flex;"><span><span style="color:#66d9ef">private</span><span style="color:#f92672">:</span>
+</span></span><span style="display:flex;"><span>    queue<span style="color:#f92672">&lt;</span><span style="color:#66d9ef">int</span><span style="color:#f92672">&gt;</span> que;
+</span></span><span style="display:flex;"><span>
+</span></span><span style="display:flex;"><span><span style="color:#66d9ef">public</span><span style="color:#f92672">:</span>
+</span></span><span style="display:flex;"><span>    RecentCounter() {}
+</span></span><span style="display:flex;"><span>    
+</span></span><span style="display:flex;"><span>    <span style="color:#66d9ef">int</span> <span style="color:#a6e22e">ping</span>(<span style="color:#66d9ef">int</span> t) {
+</span></span><span style="display:flex;"><span>        que.push(t);
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">while</span> (que.back() <span style="color:#f92672">-</span> que.front() <span style="color:#f92672">&gt;</span> <span style="color:#ae81ff">3000</span>) que.pop();
+</span></span><span style="display:flex;"><span>        
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">return</span> que.size();
+</span></span><span style="display:flex;"><span>    }
+</span></span><span style="display:flex;"><span>};
+</span></span></code></pre></div><div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"><code class="language-c" data-lang="c"><span style="display:flex;"><span>class RecentCounter {
+</span></span><span style="display:flex;"><span>private:
+</span></span><span style="display:flex;"><span>    vector<span style="color:#f92672">&lt;</span><span style="color:#66d9ef">int</span><span style="color:#f92672">&gt;</span> ls;
+</span></span><span style="display:flex;"><span>    <span style="color:#66d9ef">int</span> idx;
+</span></span><span style="display:flex;"><span>
+</span></span><span style="display:flex;"><span>public:
+</span></span><span style="display:flex;"><span>    <span style="color:#a6e22e">RecentCounter</span>() <span style="color:#f92672">:</span> <span style="color:#a6e22e">ls</span>(), <span style="color:#a6e22e">idx</span>(<span style="color:#ae81ff">0</span>) {}
+</span></span><span style="display:flex;"><span>    
+</span></span><span style="display:flex;"><span>    <span style="color:#66d9ef">int</span> <span style="color:#a6e22e">ping</span>(<span style="color:#66d9ef">int</span> t) {
+</span></span><span style="display:flex;"><span>        ls.<span style="color:#a6e22e">push_back</span>(t);
+</span></span><span style="display:flex;"><span>
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">while</span> (t <span style="color:#f92672">-</span> ls[idx] <span style="color:#f92672">&gt;</span> <span style="color:#ae81ff">3000</span>) idx <span style="color:#f92672">++</span>;
+</span></span><span style="display:flex;"><span>        <span style="color:#66d9ef">return</span> ls.<span style="color:#a6e22e">size</span>() <span style="color:#f92672">-</span> idx;
+</span></span><span style="display:flex;"><span>    }
+</span></span><span style="display:flex;"><span>};
+</span></span></code></pre></div>
+
+
+
+  
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+  
+
+
+
+<h3 id="heading-2-2">题面</h3>
+<p>写一个 <code>RecentCounter</code> 类来计算特定时间范围内最近的请求。</p>
+<p>请你实现 <code>RecentCounter</code> 类：</p>
+<ul>
+<li><code>RecentCounter()</code> 初始化计数器，请求数为 0 。</li>
+<li><code>int ping(int t)</code> 在时间 <code>t</code> 添加一个新请求，其中 <code>t</code> 表示以毫秒为单位的某个时间，并返回过去 <code>3000</code> 毫秒内发生的所有请求数（包括新请求）。确切地说，返回在 <code>[t-3000, t]</code> 内发生的请求数。</li>
+</ul>
+<p><strong>保证</strong> 每次对 <code>ping</code> 的调用都使用比之前更大的 <code>t</code> 值。</p>
+
+
+
+
+  
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+  
+
+
+
+<h3 id="heading-3-2">题解</h3>
+<p><strong>Method One</strong>: 直接法</p>
+<ul>
+<li>用队列维护 <code>ping</code> 的时间</li>
+<li>每次 <code>ping</code> 操作都先让 <code>t</code> 入队，然后将不满足条件的弹出</li>
+<li>返回队列长度即可</li>
+</ul>
+
+
+
+
+  
+
+
+
+<h2 id="2073-time-needed-to-buy-tickets">2073. Time Needed to Buy Tickets</h2>
+
+
+
+
+  
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+  
+
+
+
+<h3 id="heading-4-2">题面</h3>
+<p>有 <code>n</code> 个人前来排队买票，其中第 <code>0</code> 人站在队伍 <strong>最前方</strong> ，第 <code>(n - 1)</code> 人站在队伍 <strong>最后方</strong> 。</p>
+<p>给你一个下标从 <strong>0</strong> 开始的整数数组 <code>tickets</code> ，数组长度为 <code>n</code> ，其中第 <code>i</code> 人想要购买的票数为 <code>tickets[i]</code> 。</p>
+<p>每个人买票都需要用掉 <strong>恰好 1 秒</strong> 。一个人 <strong>一次只能买一张票</strong> ，如果需要购买更多票，他必须走到  <strong>队尾</strong> 重新排队（<strong>瞬间</strong> 发生，不计时间）。如果一个人没有剩下需要买的票，那他将会 <strong>离开</strong> 队伍。</p>
+<p>返回位于位置 <code>k</code>（下标从 <strong>0</strong> 开始）的人完成买票需要的时间（以秒为单位）。</p>
+
+
+
+
+  
+    
+      
+        
+      
+    
+      
+        
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+      
+    
+  
+
+
+
+<h3 id="heading-5-2">题解</h3>
+
   
 
       </div>
diff --git a/index.xml b/index.xml
index 7ca7f7b..01addb2 100644
--- a/index.xml
+++ b/index.xml
@@ -26,7 +26,7 @@
       <link>http://code.3000ye.com/queue/</link>
       <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
       <guid>http://code.3000ye.com/queue/</guid>
-      <description> Queue </description>
+      <description>Queue 387. First Unique Character in a String class Solution { public: int firstUniqChar(string s) { int ls[200]; for (auto c : s) { ls[c] ++; } for (int i = 0, l = s.size(); i &amp;lt; l; i ++) { if (ls[s[i]] == 1) return i; } return -1; } }; 题面 给定一个字符串 s ，找到 它的第一个不重复的字符，并返回它的索引 。如果不存在，则返回 -1 。&#xA;题解 Method One: 直接法&#xA;用一个数组记录每个字符出现的次数 遍历字符串，找到第一个只出现一次的字符 933. Number of Recent Calls class RecentCounter { private: queue&amp;lt;int&amp;gt; que; public: RecentCounter() {} int ping(int t) { que.</description>
     </item>
   </channel>
 </rss>
