docs: sync problem 15 with original content from leetcoder.net

gazeldx · gazeldx · commit a1f980ee29f7 · 2025-03-24T14:43:49.000+08:00
diff --git a/en/1-1000/15-3sum.md b/en/1-1000/15-3sum.md
@@ -1,5 +1,7 @@
-# 15. 3Sum - Best Practices of LeetCode Solutions
-LeetCode link: [15. 3Sum](https://leetcode.com/problems/3sum), difficulty: **Medium**
+Original link: [leetcoder.net - LeetCoder: Fucking Good LeetCode Solutions](https://leetcoder.net/en/leetcode/15-3sum)
+
+# 15. 3Sum - LeetCoder: Fucking Good LeetCode Solutions
+LeetCode link: [15. 3Sum](https://leetcode.com/problems/3sum), Difficulty: **Medium**.
 
 ## LeetCode description of "15. 3Sum"
 Given an integer array nums, return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.
@@ -85,8 +87,8 @@ Notice that the order of the output and the order of the triplets does not matte
     ```
 
 ## Complexity
-* Time: `O(N * N)`.
-* Space: `O(N)`.
+- Time complexity: `O(N * N)`.
+- Space complexity: `O(N)`.
 
 ## Python
 ### Solution 1: Use Map (complex and slow)
@@ -164,37 +166,7 @@ class Solution:
         return list(results)
 ```
 
-## C++
-```cpp
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Java
+## Other languages
 ```java
 // Welcome to create a PR to complete the code of this language, thanks!
 ```
-
-## JavaScript
-```javascript
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## C#
-```c#
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Go
-```go
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Ruby
-```ruby
-# Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## C, Kotlin, Swift, Rust or other languages
-```
-// Welcome to create a PR to complete the code of this language, thanks!
-```
diff --git a/zh/1-1000/15-3sum.md b/zh/1-1000/15-3sum.md
@@ -1,7 +1,9 @@
+原文链接：[leetcoder.net - 力扣题解最佳实践](https://leetcoder.net/zh/leetcode/15-3sum)
+
 # 15. 三数之和 - 力扣题解最佳实践
 力扣链接：[15. 三数之和](https://leetcode.cn/problems/3sum) ，难度：**中等**。
 
-## 力扣“15. 三数之和”问题描述
+## 力扣"15. 三数之和"问题描述
 给你一个整数数组 `nums` ，判断是否存在三元组 `[nums[i], nums[j], nums[k]]` 满足 `i != j`、`i != k` 且 `j != k` ，同时还满足 `nums[i] + nums[j] + nums[k] == 0` 。请你返回所有和为 `0` 且不重复的三元组。
 
 **注意**：答案中**不**可以包��**重复**的三元组。
@@ -82,8 +84,8 @@ nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0 。
     ```
 
 ## 复杂度
-* 时间：`O(N * N)`。
-* 空间：`O(N)`。
+- 时间：`O(N * N)`。
+- 空间：`O(N)`。
 
 ## Python
 ### Solution 1: Use Map (complex and slow)
@@ -160,37 +162,7 @@ class Solution:
         return list(results)
 ```
 
-## C++
-```cpp
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Java
+## 其他语言
 ```java
 // Welcome to create a PR to complete the code of this language, thanks!
 ```
-
-## JavaScript
-```javascript
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## C#
-```c#
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Go
-```go
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Ruby
-```ruby
-# Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## C, Kotlin, Swift, Rust or other languages
-```
-// Welcome to create a PR to complete the code of this language, thanks!
-```
