Merge pull request #745 from LetMeFly666/80

添加问题“80.删除有序数组中的重复项II”的代码和题解

Author: LetMeFly666

Codes/0080-remove-duplicates-from-sorted-array-ii.cpp

@@ -2,13 +2,13 @@
  * @Author: LetMeFly
  * @Date: 2022-06-19 09:51:38
  * @LastEditors: LetMeFly
- * @LastEditTime: 2022-06-19 10:31:22
+ * @LastEditTime: 2025-02-09 08:53:04
  */
 #ifdef _WIN32
 #include "_[1,2]toVector.h"
 #endif
 
-// TODO: 写题解
+// 写题解 - 2022年的题解计划于2025年完成了。
 
 #ifdef SecondTry  // 典型错误，数组的修改导致误认为前面已有两个相同的了
 class Solution {

Codes/0080-remove-duplicates-from-sorted-array-ii_20250209.cpp

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-02-09 08:44:41
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-02-09 08:48:30
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int slow = 1;
+        for (int fast = 2; fast < nums.size(); fast++) {
+            if (nums[fast] != nums[slow - 1]) {
+                nums[++slow] = nums[fast];
+            }
+        }
+        return min((int)nums.size(), slow + 1);
+    }
+};

Codes/0080-remove-duplicates-from-sorted-array-ii_20250209.go

@@ -0,0 +1,18 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-02-09 08:53:44
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-02-09 09:00:09
+ */
+package main
+
+func removeDuplicates(nums []int) int {
+    slow := 1
+    for fast := 2; fast < len(nums); fast++ {
+        if nums[fast] != nums[slow - 1] {
+            slow++
+            nums[slow] = nums[fast]
+        }
+    }
+    return min(slow + 1, len(nums))
+}

Codes/0080-remove-duplicates-from-sorted-array-ii_20250209.java

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-02-09 08:53:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-02-09 08:58:07
+ */
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int slow = 1;
+        for (int fast = 2; fast < nums.length; fast++) {
+            if (nums[fast] != nums[slow - 1]) {
+                nums[++slow] = nums[fast];
+            }
+        }
+        return Math.min(slow + 1, nums.length);
+    }
+}

Codes/0080-remove-duplicates-from-sorted-array-ii_20250209.py

@@ -0,0 +1,16 @@
+'''
+Author: LetMeFly
+Date: 2025-02-09 08:53:38
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-02-09 08:55:23
+'''
+from typing import List
+
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        slow = 1
+        for fast in range(2, len(nums)):
+            if nums[fast] != nums[slow - 1]:
+                slow += 1
+                nums[slow] = nums[fast]
+        return min(len(nums), slow + 1)

README.md

@@ -61,6 +61,7 @@
 |0063.不同路径II|中等|<a href="https://leetcode.cn/problems/unique-paths-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/08/LeetCode%200063.%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145509662" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/unique-paths-ii/solutions/3067362/letmefly-63bu-tong-lu-jing-iidong-tai-gu-je2m/" target="_blank">LeetCode题解</a>|
 |0067.二进制求和|简单|<a href="https://leetcode.cn/problems/add-binary/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/14/LeetCode%200067.%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125793685" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/add-binary/solution/by-tisfy-o5z5/" target="_blank">LeetCode题解</a>|
 |0070.爬楼梯|简单|<a href="https://leetcode.cn/problems/climbing-stairs/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/12/10/LeetCode%200070.%E7%88%AC%E6%A5%BC%E6%A2%AF/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134913892" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/climbing-stairs/solutions/2561558/letmefly-70pa-lou-ti-dong-tai-gui-hua-di-7d8m/" target="_blank">LeetCode题解</a>|
+|0080.删除有序数组中的重复项II|中等|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/09/LeetCode%200080.%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145528267" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/solutions/3068455/letmefly-80shan-chu-you-xu-shu-zu-zhong-b1e2i/" target="_blank">LeetCode题解</a>|
 |0082.删除排序链表中的重复元素II|中等|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/01/15/LeetCode%200082.%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135612345" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/solutions/2605736/letmefly-82shan-chu-pai-xu-lian-biao-zho-92xm/" target="_blank">LeetCode题解</a>|
 |0083.删除排序链表中的重复元素|简单|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-list/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/01/14/LeetCode%200083.%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135581000" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-list/solutions/2603584/letmefly-83shan-chu-pai-xu-lian-biao-zho-cey8/" target="_blank">LeetCode题解</a>|
 |0086.分隔链表|中等|<a href="https://leetcode.cn/problems/partition-list/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/06/26/LeetCode%200086.%E5%88%86%E9%9A%94%E9%93%BE%E8%A1%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125467594" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/partition-list/solution/letmefly-86fen-ge-lian-biao-by-tisfy-64z3/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 0080.删除有序数组中的重复项II.md

@@ -0,0 +1,214 @@
+---
+title: 80.删除有序数组中的重复项 II：双指针 - C++/Java5 行版
+date: 2025-02-09 09:08:46
+tags: [题解, LeetCode, 中等, 数组, 双指针]
+---
+
+# 【LetMeFly】80.删除有序数组中的重复项 II：双指针 - C++/Java5 行版
+
+力扣题目链接：[https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/)
+
+<p>给你一个有序数组 <code>nums</code> ，请你<strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 删除重复出现的元素，使得出现次数超过两次的元素<strong>只出现两次</strong> ，返回删除后数组的新长度。</p>
+
+<p>不要使用额外的数组空间，你必须在 <strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地 </a>修改输入数组 </strong>并在使用 O(1) 额外空间的条件下完成。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>说明：</strong></p>
+
+<p>为什么返回数值是整数，但输出的答案是数组呢？</p>
+
+<p>请注意，输入数组是以<strong>「引用」</strong>方式传递的，这意味着在函数里修改输入数组对于调用者是可见的。</p>
+
+<p>你可以想象内部操作如下:</p>
+
+<pre>
+// <strong>nums</strong> 是以“引用”方式传递的。也就是说，不对实参做任何拷贝
+int len = removeDuplicates(nums);
+
+// 在函数里修改输入数组对于调用者是可见的。
+// 根据你的函数返回的长度, 它会打印出数组中<strong> 该长度范围内</strong> 的所有元素。
+for (int i = 0; i &lt; len; i++) {
+&nbsp; &nbsp; print(nums[i]);
+}
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,1,1,2,2,3]
+<strong>输出：</strong>5, nums = [1,1,2,2,3]
+<strong>解释：</strong>函数应返回新长度 length = <strong><code>5</code></strong>, 并且原数组的前五个元素被修改为 <strong><code>1, 1, 2, 2, 3</code></strong>。 不需要考虑数组中超出新长度后面的元素。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [0,0,1,1,1,1,2,3,3]
+<strong>输出：</strong>7, nums = [0,0,1,1,2,3,3]
+<strong>解释：</strong>函数应返回新长度 length = <strong><code>7</code></strong>, 并且原数组的前七个元素被修改为&nbsp;<strong><code>0, 0, 1, 1, 2, 3, 3</code></strong>。不需要考虑数组中超出新长度后面的元素。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 3 * 10<sup>4</sup></code></li>
+	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
+	<li><code>nums</code> 已按升序排列</li>
+</ul>
+
+
+    
+## 解题方法一：快慢指针
+
+使用一个慢指针指向数组中已经合法的元素（初始值为1，因为前两个元素必合法），使用一个快指针指向当前遍历到的元素。
+
+快指针从下标`2`开始遍历，如果快指针指向元素和慢指针指向元素的前一个元素不同，则快指针指向元素可以合法地加入数组（慢指针右移一位，快指针元素放到慢指针位置）。
+
++ 时间复杂度$O(len(nums))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-02-09 08:44:41
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-02-09 08:48:30
+ */
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int slow = 1;
+        for (int fast = 2; fast < nums.size(); fast++) {
+            if (nums[fast] != nums[slow - 1]) {
+                nums[++slow] = nums[fast];
+            }
+        }
+        return min((int)nums.size(), slow + 1);
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-02-09 08:53:38
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-02-09 08:55:23
+'''
+from typing import List
+
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        slow = 1
+        for fast in range(2, len(nums)):
+            if nums[fast] != nums[slow - 1]:
+                slow += 1
+                nums[slow] = nums[fast]
+        return min(len(nums), slow + 1)
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-02-09 08:53:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-02-09 08:58:07
+ */
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int slow = 1;
+        for (int fast = 2; fast < nums.length; fast++) {
+            if (nums[fast] != nums[slow - 1]) {
+                nums[++slow] = nums[fast];
+            }
+        }
+        return Math.min(slow + 1, nums.length);
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-02-09 08:53:44
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-02-09 09:00:09
+ */
+package main
+
+func removeDuplicates(nums []int) int {
+    slow := 1
+    for fast := 2; fast < len(nums); fast++ {
+        if nums[fast] != nums[slow - 1] {
+            slow++
+            nums[slow] = nums[fast]
+        }
+    }
+    return min(slow + 1, len(nums))
+}
+```
+
+## 解题方法二：易想版本
+
+> 来[自](https://github.com/LetMeFly666/LeetCode/blob/64231493342ec7c9a18147c5f32d4e6211df7e33/Codes/0080-remove-duplicates-from-sorted-array-ii.cpp)2022.6.19，当时就想[写题解](https://github.com/LetMeFly666/LeetCode/blob/64231493342ec7c9a18147c5f32d4e6211df7e33/Codes/0080-remove-duplicates-from-sorted-array-ii.cpp#L11)了。
+
+如果[方法一](#解题方法一快慢指针)难想怎么办？很简单，使用两个指针指向“相同连续元素”的始末位置总可以了吧。
+
+每次得到一种元素的始末位置后，就放置`min(2, 这种元素个数)`个这种元素到“合法数组”中就好了。
+
++ 时间复杂度$O(len(nums))$
++ 空间复杂度$O(1)$
+
+### [AC](https://github.com/LetMeFly666/LeetCode/blob/64231493342ec7c9a18147c5f32d4e6211df7e33/Codes/0080-remove-duplicates-from-sorted-array-ii.cpp#L1-L6)[代码](https://github.com/LetMeFly666/LeetCode/blob/64231493342ec7c9a18147c5f32d4e6211df7e33/Codes/0080-remove-duplicates-from-sorted-array-ii.cpp#L42-L58)
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2022-06-19 09:51:38
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2022-06-19 10:31:22
+ */
+
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int cnt = 0;
+        int l = 0, r = 1;  // [l, r)相同
+        nums.push_back(1e5);
+        for (; r < nums.size(); r++) {
+            if (nums[r] != nums[l]) {
+                for (int i = 0; i < min(2, r - l); i++) {
+                    nums[cnt++] = nums[r - 1];
+                }
+                l = r;
+            }
+        }
+        return cnt;
+    }
+};
+```
+
+## End
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/145528267)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/02/09/LeetCode%200080.%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9II/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
+>
+> Tisfy：[https://blog.letmefly.xyz/2025/02/09/LeetCode 0080.删除有序数组中的重复项II](https://blog.letmefly.xyz/2025/02/09/LeetCode%200080.%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9II/)

Solutions/Other-Accumulation-Messy.md

@@ -1726,6 +1726,52 @@ Go中`a := b`，若`b`是值类型则会发生值拷贝，修改`a`不会修改`
 + 常见值类型：基本类型（int、string、...）、数组、结构体
 + 常见引用类型：切片、映射、通道、函数、指针
 
+### Kitex使用日记
+
+From: [Github@LetMeFly666/LeetCode/tryGoPy/Go/douyinec/README.md](https://github.com/LetMeFly666/LeetCode/blob/b51c7e73c9798b0fd397ab2e131ba33868e47ad3/tryGoPy/Go/douyinec/README.md)
+
+```bash
+git clone git@cloudwego/kitex-examples.git
+cd kitex-example
+go run .  # 这里我本来使用的Go 1.19.5不支持go.mod里的toolchain，所以升级为了当前最新版go1.23.5
+# 令起终端
+go run ./client
+```
+
+#### 开了个私有仓库来记录kitex学习过程中的修改
+
+[Github@LetMeFly666/kitex-examples](https://github.com/LetMeFly666/kitex-examples/)
+
+起了个别名：
+
+```bash
+git config --local alias.pushLet "push Let main:master"
+```
+
+后续想要push到远端的时候直接`git pushLet`就好。
+
+TODOED: 给CloudWeGo提PR，不sleep 1 秒。
+
+可行吗？试试吧。像个办法看进程启动了还是异常退出了。
+
+不行就不PR了。
+
+TODOED: https://www.cloudwego.io/zh/docs/kitex/getting-started/tutorial/#%E6%8B%89%E5%8F%96%E4%BE%9D%E8%B5%96  的上面的代码段，build.sh后面有一个tab，导致渲染出来的注释不对齐
+
+#### 自定义RPC函数
+
+1. 修改`.thrift`文件
+2. 使用`kitex`生成新代码文件
+    
+    ```bash
+    kitex -module "github.com/cloudwego/kitex-examples" -service a.b.c hello.thrift
+    ```
+
+3. 更新`go`文件
+
+    1. 更新`./handler.go`，实现自定义的RPC函数
+    2. 更新`./client/main.go`，调用这个远程函数
+
 ## sth. about 漯河日报（特指网站） - 发现By [我](https://letmefly.xyz/)和[shy](https://web.letmefly.xyz/He0/shykeke/)
 
 由一本书引发了漯河日报的[一篇文章](http://rb.lhrb.com.cn/html/2018-06/28/content_25454.htm)，然后开始了一点点对于日报官网的探究。

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -990,6 +990,8 @@ tags: [其他, 知识, 英语, Notes]
 |sculptor|n. 雕刻家，雕塑家|
 |ashore|adv. 在岸上，上岸|
 |tramp|n. 流浪汉，沉重的脚步声，长途跋涉<br/>v. 脚步沉重地行走，跋涉，踏|
+|||
+|fathom| n. 英寻(测量水深单位，合6英尺或1.8米)<br/>v. 理解，彻底了解，弄清真相|
 
 <p class="wordCounts">单词收录总数</p>