Site updated: 2024-11-15 09:02:49

Author: simuleite

ComputerScience/基本操作/git使用/index.html

@@ -28,7 +28,7 @@
 <meta property="og:description" content="1.0 第一件事git config  git config --list --show-origin查看所有git配置以及所在文件 使用git config --global可以设置git的基本信息（如用户名、邮箱），使用--unset取消设置  配置你的名称、邮箱以及编辑器    git config --global user.name &quot;191220000-Zhang San&amp;">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2023-11-08T16:00:00.000Z">
-<meta property="article:modified_time" content="2024-08-27T01:15:55.099Z">
+<meta property="article:modified_time" content="2024-11-12T10:01:07.453Z">
 <meta property="article:author" content="SIMULEITE">
 <meta property="article:tag" content="基本操作">
 <meta name="twitter:card" content="summary">
@@ -231,7 +231,7 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2024-08-27 09:15:55" itemprop="dateModified" datetime="2024-08-27T09:15:55+08:00">2024-08-27</time>
+      <time title="修改时间：2024-11-12 18:01:07" itemprop="dateModified" datetime="2024-11-12T18:01:07+08:00">2024-11-12</time>
     </span>
 
 
@@ -268,6 +268,7 @@ <h1 id="30-记录更新"><a class="markdownIt-Anchor" href="#30-记录更新"></
 <ul>
 <li><code>git status</code> 查看结果（会显示你对什么文件做了什么修改、操作），显示当前的仓库状态；<code>-s</code>参数简短输出</li>
 <li><code>git diff</code> 展示修改，具体查看修改内容</li>
+<li><code>git ls-files</code> 查看git已跟踪文件</li>
 <li><code>git commit -m &quot;comment&quot;</code> 创建一个新的提交</li>
 <li><code>git rm</code> 移除文件，<code>--cached</code>表明只删除版本文件，保留本地文件</li>
 <li><code>git rm -r --cache .</code> 取消跟踪所有文件</li>

ComputerScience/指南/Deep Reading/index.html

@@ -28,7 +28,7 @@
 <meta property="og:description" content="一号标题  Title 2  三号标题  Title 4  五号标题  Title 6     标题 标题 标题     左对齐 两端对齐 右对齐     Unordered List  Unordered List     Ordered List 2. Ordered List   [x] TO-DO List [] TO-DO List  Delete Line Blod Italic C">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2023-11-09T16:00:00.000Z">
-<meta property="article:modified_time" content="2024-10-12T03:02:36.866Z">
+<meta property="article:modified_time" content="2024-11-03T07:06:48.068Z">
 <meta property="article:author" content="SIMULEITE">
 <meta property="article:tag" content="指南">
 <meta name="twitter:card" content="summary">
@@ -231,7 +231,7 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2024-10-12 11:02:36" itemprop="dateModified" datetime="2024-10-12T11:02:36+08:00">2024-10-12</time>
+      <time title="修改时间：2024-11-03 15:06:48" itemprop="dateModified" datetime="2024-11-03T15:06:48+08:00">2024-11-03</time>
     </span>
 
 
@@ -316,6 +316,8 @@ <h6 id="title-6"><a class="markdownIt-Anchor" href="#title-6"></a> Title 6</h6>
 <p>[!INFO]<br />
 Here is some INFO.</p>
 </blockquote>
+<div class="note primary"><p>primary 提示块标签</p>
+</div>
 <hr class="footnotes-sep" />
 <section class="footnotes">
 <ol class="footnotes-list">

ComputerScience/指南/Markdown模板/index.html

@@ -28,7 +28,7 @@
 <meta property="og:description" content="Hash  字母异位词 排序每一个单词，就知道是不是异位词。  两数之和 从数组中，找到nums[i] + nums[j] &#x3D;&#x3D; target，并返回&#123; i, j &#125;。 思路是双重循环，遍历每一个元素，求和是否为target。 然而，双重循环需要O(N2)O(N^2)O(N2)的复杂度。因此，可以使用一张表，使用containsKey方法识别是否存在当前i的target -">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2024-09-30T16:00:00.000Z">
-<meta property="article:modified_time" content="2024-10-27T11:07:58.821Z">
+<meta property="article:modified_time" content="2024-11-05T03:27:07.647Z">
 <meta property="article:author" content="SIMULEITE">
 <meta property="article:tag" content="笔记">
 <meta name="twitter:card" content="summary">
@@ -138,7 +138,7 @@
       <div class="sidebar-panel-container">
         <!--noindex-->
         <div class="post-toc-wrap sidebar-panel">
-            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#hash"><span class="nav-text"> Hash</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D"><span class="nav-text"> 字母异位词</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C"><span class="nav-text"> 两数之和</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3"><span class="nav-text"> 关键思想</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97"><span class="nav-text"> 最长连续序列</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3-2"><span class="nav-text"> 关键思想</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#stack"><span class="nav-text"> Stack</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6"><span class="nav-text"> 每日温度</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3-3"><span class="nav-text"> 关键思想</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#list"><span class="nav-text"> List</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F"><span class="nav-text"> 链表排序</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%88%A0%E9%99%A4%E5%80%92%E6%95%B0%E7%AC%ACn%E4%B8%AA%E8%8A%82%E7%82%B9"><span class="nav-text"> 删除倒数第N个节点</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#tree"><span class="nav-text"> Tree</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%AF%B9%E7%A7%B0%E6%A0%91"><span class="nav-text"> 对称树</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6"><span class="nav-text"> 最大深度</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E9%95%BF%E7%9B%B4%E5%BE%84"><span class="nav-text"> 最长直径</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8F%8D%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="nav-text"> 反转二叉树</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8F%8C%E6%8C%87%E9%92%88"><span class="nav-text"> 双指针</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%A7%BB%E5%8A%A80"><span class="nav-text"> 移动0</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92dp"><span class="nav-text"> 动态规划，DP</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%E5%92%8C%E9%97%AE%E9%A2%98"><span class="nav-text"> 不同路径和问题</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E7%88%AC%E6%A5%BC%E6%A2%AF"><span class="nav-text"> 爬楼梯</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84ii"><span class="nav-text"> 不同路径II</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E5%A4%A7%E6%9C%80%E5%B0%8F%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%E9%97%AE%E9%A2%98"><span class="nav-text"> 最大&#x2F;最小不同路径问题</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2"><span class="nav-text"> 零钱兑换</span></a></li></ol></li></ol></li></ol></div>
+            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#hash"><span class="nav-text"> Hash</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D"><span class="nav-text"> 字母异位词</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C"><span class="nav-text"> 两数之和</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3"><span class="nav-text"> 关键思想</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97"><span class="nav-text"> 最长连续序列</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3-2"><span class="nav-text"> 关键思想</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#stack"><span class="nav-text"> Stack</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8D%95%E8%B0%83%E6%A0%88"><span class="nav-text"> 单调栈</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6"><span class="nav-text"> 每日温度</span></a><ol class="nav-child"><li class="nav-item nav-level-4"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3-3"><span class="nav-text"> 关键思想</span></a></li></ol></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0-i"><span class="nav-text"> 下一个更大元素 I</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97"><span class="nav-text"> 栈实现队列</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%85%B3%E9%94%AE%E6%80%9D%E6%83%B3-4"><span class="nav-text"> 关键思想</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#list"><span class="nav-text"> List</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E9%93%BE%E8%A1%A8%E6%8E%92%E5%BA%8F"><span class="nav-text"> 链表排序</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%88%A0%E9%99%A4%E5%80%92%E6%95%B0%E7%AC%ACn%E4%B8%AA%E8%8A%82%E7%82%B9"><span class="nav-text"> 删除倒数第N个节点</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#tree"><span class="nav-text"> Tree</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%AF%B9%E7%A7%B0%E6%A0%91"><span class="nav-text"> 对称树</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6"><span class="nav-text"> 最大深度</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E9%95%BF%E7%9B%B4%E5%BE%84"><span class="nav-text"> 最长直径</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8F%8D%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="nav-text"> 反转二叉树</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8F%8C%E6%8C%87%E9%92%88"><span class="nav-text"> 双指针</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%A7%BB%E5%8A%A80"><span class="nav-text"> 移动0</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92dp"><span class="nav-text"> 动态规划，DP</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%E5%92%8C%E9%97%AE%E9%A2%98"><span class="nav-text"> 不同路径和问题</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E7%88%AC%E6%A5%BC%E6%A2%AF"><span class="nav-text"> 爬楼梯</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84ii"><span class="nav-text"> 不同路径II</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%9C%80%E5%A4%A7%E6%9C%80%E5%B0%8F%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84%E9%97%AE%E9%A2%98"><span class="nav-text"> 最大&#x2F;最小不同路径问题</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2"><span class="nav-text"> 零钱兑换</span></a></li></ol></li></ol></li></ol></div>
         </div>
         <!--/noindex-->
 
@@ -231,7 +231,7 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2024-10-27 19:07:58" itemprop="dateModified" datetime="2024-10-27T19:07:58+08:00">2024-10-27</time>
+      <time title="修改时间：2024-11-05 11:27:07" itemprop="dateModified" datetime="2024-11-05T11:27:07+08:00">2024-11-05</time>
     </span>
 
 
@@ -265,13 +265,20 @@ <h3 id="关键思想-2"><a class="markdownIt-Anchor" href="#关键思想-2"></a>
 <p>去重；不处理中间值</p>
 <span id="more"></span>
 <h1 id="stack"><a class="markdownIt-Anchor" href="#stack"></a> Stack</h1>
-<h2 id="每日温度"><a class="markdownIt-Anchor" href="#每日温度"></a> 每日温度</h2>
+<h1 id="单调栈"><a class="markdownIt-Anchor" href="#单调栈"></a> 单调栈</h1>
+<figure class="highlight java"><table><tr><td class="code"><pre><span class="line"><span class="keyword">for</span> (<span class="type">int</span> num: nums) &#123;</span><br><span class="line">    <span class="comment">// 没找到更大数就呆在栈里；找到更大数的出栈并存入Map</span></span><br><span class="line">    <span class="keyword">while</span> (!stk.isEmpty() &amp;&amp; num &gt; stk.peek()) &#123;</span><br><span class="line">        map.put(stk.peek(), num);</span><br><span class="line">        stk.pop();</span><br><span class="line">    &#125;</span><br><span class="line">    stk.push(num);</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
+<h3 id="每日温度"><a class="markdownIt-Anchor" href="#每日温度"></a> 每日温度</h3>
 <p>给一个长度为N的每日温度数组，返回一个数组，记录每一天距离下次升温的天数。</p>
 <p>可以用双重循环，找到比当前温度大的那一天，但是这样效率太低。</p>
 <p>优化：<br />
 使用栈，存取没有找到升温日的index，找到升温日后，一次性处理完，减少一重循环。</p>
-<h3 id="关键思想-3"><a class="markdownIt-Anchor" href="#关键思想-3"></a> 关键思想</h3>
+<h4 id="关键思想-3"><a class="markdownIt-Anchor" href="#关键思想-3"></a> 关键思想</h4>
 <p>使用栈存储未处理的值，找到升温日后一次性处理，减少重复动作。</p>
+<h3 id="下一个更大元素-i"><a class="markdownIt-Anchor" href="#下一个更大元素-i"></a> 下一个更大元素 I</h3>
+<p>num1为num2子集，所以只遍历num2，找到num2[i]右边的大数，存入Map；将Map结果去到num1即可。</p>
+<h1 id="栈实现队列"><a class="markdownIt-Anchor" href="#栈实现队列"></a> 栈实现队列</h1>
+<h2 id="关键思想-4"><a class="markdownIt-Anchor" href="#关键思想-4"></a> 关键思想</h2>
+<p>两个栈<code>in</code>和<code>out</code>，只有<code>out</code>为空时，才将<code>in</code>pop到<code>out</code>中。否则会出错。</p>
 <h1 id="list"><a class="markdownIt-Anchor" href="#list"></a> List</h1>
 <h2 id="链表排序"><a class="markdownIt-Anchor" href="#链表排序"></a> 链表排序</h2>
 <p>链表的两种排序方法：插入排序和归并排序。<br />