Site updated: 2020-03-27 23:57:04

tony-coder · tony-coder · commit 0f4b8c1d5c70 · 2020-03-27T23:57:04.000+08:00
diff --git a/2020/03/23/876. 链表的中间结点/index.html b/2020/03/23/876. 链表的中间结点/index.html
@@ -326,7 +326,7 @@ <h1 class="article-title" itemprop="name">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          876. 链表的中间结点
+          945. 使数组唯一的最小增量
         
       </div>
     </a>
diff --git a/2020/03/27/945. 使数组唯一的最小增量/index.html b/2020/03/27/945. 使数组唯一的最小增量/index.html
@@ -6,11 +6,11 @@
   <meta name="renderer" content="webkit">
   <meta http-equiv="X-UA-Compatible" content="IE=edge" >
   <link rel="dns-prefetch" href="http://yoursite.com">
-  <title>876. 链表的中间结点 | 鲍锋雄的博客</title>
+  <title>945. 使数组唯一的最小增量 | 鲍锋雄的博客</title>
   <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">
   <meta name="description" content="945. 使数组唯一的最小增量 给定整数数组 A，每次 move 操作将会选择任意$A[i]$，并将其递增$1$。 返回使 A 中的每个值都是唯一的最少操作次数。 示例 1: 123输入：[1,2,2]输出：1解释：经过一次 move 操作，数组将变为 [1, 2, 3]。  示例 2: 12345输入：[3,2,1,2,1,7]输出：6解释：经过 6 次 move 操作，数组将变为 [3, 4,">
 <meta property="og:type" content="article">
-<meta property="og:title" content="876. 链表的中间结点">
+<meta property="og:title" content="945. 使数组唯一的最小增量">
 <meta property="og:url" content="http://yoursite.com/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/index.html">
 <meta property="og:site_name" content="鲍锋雄的博客">
 <meta property="og:description" content="945. 使数组唯一的最小增量 给定整数数组 A，每次 move 操作将会选择任意$A[i]$，并将其递增$1$。 返回使 A 中的每个值都是唯一的最少操作次数。 示例 1: 123输入：[1,2,2]输出：1解释：经过一次 move 操作，数组将变为 [1, 2, 3]。  示例 2: 12345输入：[3,2,1,2,1,7]输出：6解释：经过 6 次 move 操作，数组将变为 [3, 4,">
@@ -22,7 +22,7 @@
 <meta property="og:image" content="https://i.loli.net/2020/03/26/6asjkXSF13lAhJf.png">
 <meta property="og:image" content="https://i.loli.net/2020/03/26/UbeaOFruMVyiYKd.png">
 <meta property="article:published_time" content="2020-03-27T15:53:25.271Z">
-<meta property="article:modified_time" content="2020-03-27T15:53:44.445Z">
+<meta property="article:modified_time" content="2020-03-27T15:56:46.228Z">
 <meta property="article:author" content="bfx">
 <meta property="article:tag" content="Leetcode">
 <meta name="twitter:card" content="summary">
@@ -175,7 +175,7 @@ <h1 class="header-author js-header-author">bfx</h1>
         
   
     <h1 class="article-title" itemprop="name">
-      876. 链表的中间结点
+      945. 使数组唯一的最小增量
     </h1>
   
 
diff --git a/archives/2020/03/index.html b/archives/2020/03/index.html
@@ -199,7 +199,7 @@ <h1 class="header-author js-header-author">bfx</h1>
     	 
   
     <h1 itemprop="name">
-      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">876. 链表的中间结点</a>
+      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">945. 使数组唯一的最小增量</a>
     </h1>
   
 
diff --git a/archives/2020/index.html b/archives/2020/index.html
@@ -199,7 +199,7 @@ <h1 class="header-author js-header-author">bfx</h1>
     	 
   
     <h1 itemprop="name">
-      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">876. 链表的中间结点</a>
+      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">945. 使数组唯一的最小增量</a>
     </h1>
   
 
diff --git a/archives/index.html b/archives/index.html
@@ -199,7 +199,7 @@ <h1 class="header-author js-header-author">bfx</h1>
     	 
   
     <h1 itemprop="name">
-      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">876. 链表的中间结点</a>
+      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">945. 使数组唯一的最小增量</a>
     </h1>
   
 
diff --git a/content.json b/content.json
@@ -1 +1 @@
-[{"title":"876. 链表的中间结点","date":"2020-03-27T15:53:25.271Z","path":"2020/03/27/945. 使数组唯一的最小增量/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"876. 链表的中间结点","date":"2020-03-23T14:44:27.130Z","path":"2020/03/23/876. 链表的中间结点/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"线性时间选择问题","date":"2020-03-20T13:26:31.000Z","path":"2020/03/20/线性时间选择问题/","tags":[{"name":"算法","slug":"算法","permalink":"http://yoursite.com/tags/%E7%AE%97%E6%B3%95/"},{"name":"分治","slug":"分治","permalink":"http://yoursite.com/tags/%E5%88%86%E6%B2%BB/"}]},{"title":"1076 Forwards on Weibo (30分)","date":"2020-03-10T08:51:37.136Z","path":"2020/03/10/1076 Forwards on Weibo (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"一篇文章讲清楚Gradle与Gradle Wrapper的区别","date":"2020-03-06T11:52:09.986Z","path":"2020/03/06/一篇文章讲清楚Gradle与Gradle Wrapper的区别/","tags":[{"name":"构建工具","slug":"构建工具","permalink":"http://yoursite.com/tags/%E6%9E%84%E5%BB%BA%E5%B7%A5%E5%85%B7/"}]},{"title":"1119 Pre- and Post-order Traversals (30分)","date":"2020-03-05T14:17:04.357Z","path":"2020/03/05/1119 Pre- and Post-order Traversals (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"bean的生命周期","date":"2020-03-05T07:34:39.139Z","path":"2020/03/05/bean的生命周期/","tags":[{"name":"Java","slug":"Java","permalink":"http://yoursite.com/tags/Java/"},{"name":"Spring","slug":"Spring","permalink":"http://yoursite.com/tags/Spring/"}]},{"title":"1064 Complete Binary Search Tree (30分)","date":"2020-03-04T01:31:02.291Z","path":"2020/03/04/1064 Complete Binary Search Tree (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"1094 The Largest Generation (25分)","date":"2020-03-02T03:50:29.787Z","path":"2020/03/02/1094 The Largest Generation (25分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"My First Post","date":"2020-01-22T12:59:37.000Z","path":"2020/01/22/My-First-Post/","tags":[]},{"title":"Hello World","date":"2020-01-22T07:52:45.957Z","path":"2020/01/22/hello-world/","tags":[]}]
+[{"title":"945. 使数组唯一的最小增量","date":"2020-03-27T15:53:25.271Z","path":"2020/03/27/945. 使数组唯一的最小增量/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"876. 链表的中间结点","date":"2020-03-23T14:44:27.130Z","path":"2020/03/23/876. 链表的中间结点/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"线性时间选择问题","date":"2020-03-20T13:26:31.000Z","path":"2020/03/20/线性时间选择问题/","tags":[{"name":"算法","slug":"算法","permalink":"http://yoursite.com/tags/%E7%AE%97%E6%B3%95/"},{"name":"分治","slug":"分治","permalink":"http://yoursite.com/tags/%E5%88%86%E6%B2%BB/"}]},{"title":"1076 Forwards on Weibo (30分)","date":"2020-03-10T08:51:37.136Z","path":"2020/03/10/1076 Forwards on Weibo (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"一篇文章讲清楚Gradle与Gradle Wrapper的区别","date":"2020-03-06T11:52:09.986Z","path":"2020/03/06/一篇文章讲清楚Gradle与Gradle Wrapper的区别/","tags":[{"name":"构建工具","slug":"构建工具","permalink":"http://yoursite.com/tags/%E6%9E%84%E5%BB%BA%E5%B7%A5%E5%85%B7/"}]},{"title":"1119 Pre- and Post-order Traversals (30分)","date":"2020-03-05T14:17:04.357Z","path":"2020/03/05/1119 Pre- and Post-order Traversals (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"bean的生命周期","date":"2020-03-05T07:34:39.139Z","path":"2020/03/05/bean的生命周期/","tags":[{"name":"Java","slug":"Java","permalink":"http://yoursite.com/tags/Java/"},{"name":"Spring","slug":"Spring","permalink":"http://yoursite.com/tags/Spring/"}]},{"title":"1064 Complete Binary Search Tree (30分)","date":"2020-03-04T01:31:02.291Z","path":"2020/03/04/1064 Complete Binary Search Tree (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"1094 The Largest Generation (25分)","date":"2020-03-02T03:50:29.787Z","path":"2020/03/02/1094 The Largest Generation (25分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"My First Post","date":"2020-01-22T12:59:37.000Z","path":"2020/01/22/My-First-Post/","tags":[]},{"title":"Hello World","date":"2020-01-22T07:52:45.957Z","path":"2020/01/22/hello-world/","tags":[]}]
diff --git a/index.html b/index.html
@@ -184,7 +184,7 @@ <h1 class="header-author js-header-author">bfx</h1>
         
   
     <h1 itemprop="name">
-      <a class="article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">876. 链表的中间结点</a>
+      <a class="article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">945. 使数组唯一的最小增量</a>
     </h1>
   
 
diff --git a/tags/Leetcode/index.html b/tags/Leetcode/index.html
@@ -199,7 +199,7 @@ <h1 class="header-author js-header-author">bfx</h1>
     	 
   
     <h1 itemprop="name">
-      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">876. 链表的中间结点</a>
+      <a class="archive-article-title" href="/2020/03/27/945.%20%E4%BD%BF%E6%95%B0%E7%BB%84%E5%94%AF%E4%B8%80%E7%9A%84%E6%9C%80%E5%B0%8F%E5%A2%9E%E9%87%8F/">945. 使数组唯一的最小增量</a>
     </h1>
   
 

Original file line number	Diff line number	Diff line change
`@@ -1 +1 @@`
`1`		-[{"title":"876. 链表的中间结点","date":"2020-03-27T15:53:25.271Z","path":"2020/03/27/945. 使数组唯一的最小增量/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"876. 链表的中间结点","date":"2020-03-23T14:44:27.130Z","path":"2020/03/23/876. 链表的中间结点/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"线性时间选择问题","date":"2020-03-20T13:26:31.000Z","path":"2020/03/20/线性时间选择问题/","tags":[{"name":"算法","slug":"算法","permalink":"http://yoursite.com/tags/%E7%AE%97%E6%B3%95/"},{"name":"分治","slug":"分治","permalink":"http://yoursite.com/tags/%E5%88%86%E6%B2%BB/"}]},{"title":"1076 Forwards on Weibo (30分)","date":"2020-03-10T08:51:37.136Z","path":"2020/03/10/1076 Forwards on Weibo (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"一篇文章讲清楚Gradle与Gradle Wrapper的区别","date":"2020-03-06T11:52:09.986Z","path":"2020/03/06/一篇文章讲清楚Gradle与Gradle Wrapper的区别/","tags":[{"name":"构建工具","slug":"构建工具","permalink":"http://yoursite.com/tags/%E6%9E%84%E5%BB%BA%E5%B7%A5%E5%85%B7/"}]},{"title":"1119 Pre- and Post-order Traversals (30分)","date":"2020-03-05T14:17:04.357Z","path":"2020/03/05/1119 Pre- and Post-order Traversals (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"bean的生命周期","date":"2020-03-05T07:34:39.139Z","path":"2020/03/05/bean的生命周期/","tags":[{"name":"Java","slug":"Java","permalink":"http://yoursite.com/tags/Java/"},{"name":"Spring","slug":"Spring","permalink":"http://yoursite.com/tags/Spring/"}]},{"title":"1064 Complete Binary Search Tree (30分)","date":"2020-03-04T01:31:02.291Z","path":"2020/03/04/1064 Complete Binary Search Tree (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"1094 The Largest Generation (25分)","date":"2020-03-02T03:50:29.787Z","path":"2020/03/02/1094 The Largest Generation (25分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"My First Post","date":"2020-01-22T12:59:37.000Z","path":"2020/01/22/My-First-Post/","tags":[]},{"title":"Hello World","date":"2020-01-22T07:52:45.957Z","path":"2020/01/22/hello-world/","tags":[]}]
	`1`	+[{"title":"945. 使数组唯一的最小增量","date":"2020-03-27T15:53:25.271Z","path":"2020/03/27/945. 使数组唯一的最小增量/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"876. 链表的中间结点","date":"2020-03-23T14:44:27.130Z","path":"2020/03/23/876. 链表的中间结点/","tags":[{"name":"Leetcode","slug":"Leetcode","permalink":"http://yoursite.com/tags/Leetcode/"}]},{"title":"线性时间选择问题","date":"2020-03-20T13:26:31.000Z","path":"2020/03/20/线性时间选择问题/","tags":[{"name":"算法","slug":"算法","permalink":"http://yoursite.com/tags/%E7%AE%97%E6%B3%95/"},{"name":"分治","slug":"分治","permalink":"http://yoursite.com/tags/%E5%88%86%E6%B2%BB/"}]},{"title":"1076 Forwards on Weibo (30分)","date":"2020-03-10T08:51:37.136Z","path":"2020/03/10/1076 Forwards on Weibo (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"一篇文章讲清楚Gradle与Gradle Wrapper的区别","date":"2020-03-06T11:52:09.986Z","path":"2020/03/06/一篇文章讲清楚Gradle与Gradle Wrapper的区别/","tags":[{"name":"构建工具","slug":"构建工具","permalink":"http://yoursite.com/tags/%E6%9E%84%E5%BB%BA%E5%B7%A5%E5%85%B7/"}]},{"title":"1119 Pre- and Post-order Traversals (30分)","date":"2020-03-05T14:17:04.357Z","path":"2020/03/05/1119 Pre- and Post-order Traversals (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"bean的生命周期","date":"2020-03-05T07:34:39.139Z","path":"2020/03/05/bean的生命周期/","tags":[{"name":"Java","slug":"Java","permalink":"http://yoursite.com/tags/Java/"},{"name":"Spring","slug":"Spring","permalink":"http://yoursite.com/tags/Spring/"}]},{"title":"1064 Complete Binary Search Tree (30分)","date":"2020-03-04T01:31:02.291Z","path":"2020/03/04/1064 Complete Binary Search Tree (30分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"1094 The Largest Generation (25分)","date":"2020-03-02T03:50:29.787Z","path":"2020/03/02/1094 The Largest Generation (25分)/","tags":[{"name":"PAT刷题记录","slug":"PAT刷题记录","permalink":"http://yoursite.com/tags/PAT%E5%88%B7%E9%A2%98%E8%AE%B0%E5%BD%95/"}]},{"title":"My First Post","date":"2020-01-22T12:59:37.000Z","path":"2020/01/22/My-First-Post/","tags":[]},{"title":"Hello World","date":"2020-01-22T07:52:45.957Z","path":"2020/01/22/hello-world/","tags":[]}]