feat:替换英文 (azl397985856#441)

Author: yulecc

SUMMARY.md

@@ -1,9 +1,11 @@
 ## 题目地址（1011. 在 D 天内送达包裹的能力）
 
-https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days
+https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days/
 
 ## 题目描述
 
+```
+
 传送带上的包裹必须在 D 天内从一个港口运送到另一个港口。
 
 传送带上的第 i  个包裹的重量为  weights[i]。每一天，我们都会按给出重量的顺序往传送带上装载包裹。我们装载的重量不会超过船的最大运载重量。
@@ -47,6 +49,8 @@ https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days
 1 <= D <= weights.length <= 50000
 1 <= weights[i] <= 500
 
+```
+
 ## 前置知识
 
 - 二分法

problems/1011.capacity-to-ship-packages-within-d-days-cn.md renamed to problems/1011.capacity-to-ship-packages-within-d-days.md

@@ -1,9 +1,11 @@
 ## 题目地址(1014. 最佳观光组合)
 
-https://leetcode-cn.com/problems/best-sightseeing-pair/description/
+https://leetcode-cn.com/problems/best-sightseeing-pair/
 
 ## 题目描述
 
+```
+
 给定正整数数组  A，A[i]  表示第 i 个观光景点的评分，并且两个景点  i 和  j  之间的距离为  j - i。
 
 一对景点（i < j）组成的观光组合的得分为（A[i] + A[j] + i - j）：景点的评分之和减去它们两者之间的距离。
@@ -21,6 +23,8 @@ https://leetcode-cn.com/problems/best-sightseeing-pair/description/
 2 <= A.length <= 50000
 1 <= A[i] <= 1000
 
+```
+
 ## 前置知识
 
 - 动态规划

problems/1014.best-sightseeing-pair.md

@@ -1,6 +1,6 @@
-## 题目地址
+## 题目地址(1015. 可被 K 整除的最小整数)
 
-https://leetcode-cn.com/problems/smallest-integer-divisible-by-k/description/
+https://leetcode-cn.com/problems/smallest-integer-divisible-by-k/
 
 ## 题目描述
 

problems/1015.smallest-integer-divisible-by-k.md

@@ -1,6 +1,6 @@
-## 题目地址
+## 题目地址(1019. 链表中的下一个更大节点)
 
-https://leetcode-cn.com/problems/next-greater-node-in-linked-list/submissions/
+https://leetcode-cn.com/problems/next-greater-node-in-linked-list/
 
 ## 题目描述
 

problems/1019.next-greater-node-in-linked-list.md

@@ -1,6 +1,6 @@
 
-## 题目地址
-https://leetcode.com/problems/binary-tree-level-order-traversal/description/
+## 题目地址(102. 二叉树的层序遍历)
+https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
 
 ## 题目描述
 ```

problems/102.binary-tree-level-order-traversal.md

@@ -1,4 +1,4 @@
-## 题目地址
+## 题目地址(1020. 飞地的数量)
 
 https://leetcode-cn.com/problems/number-of-enclaves/
 

problems/1020.number-of-enclaves.md

@@ -1,4 +1,4 @@
-## 题目地址
+## 题目地址(1023. 驼峰式匹配)
 
 https://leetcode-cn.com/problems/camelcase-matching/
 

problems/1023.camelcase-matching.md

@@ -1,26 +1,29 @@
 
-## 题目地址
-https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/
+## 题目地址(103. 二叉树的锯齿形层次遍历)
+https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/
 
 ## 题目描述
 和leetcode 102 基本是一样的，思路是完全一样的。
 
 ```
-Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
+给定一个二叉树，返回其节点值的锯齿形层次遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。
+
+例如：
+给定二叉树 [3,9,20,null,null,15,7],
 
-For example:
-Given binary tree [3,9,20,null,null,15,7],
     3
    / \
   9  20
     /  \
    15   7
-return its zigzag level order traversal as:
+返回锯齿形层次遍历如下：
+
 [
   [3],
   [20,9],
   [15,7]
 ]
+
 ```
 
 ## 前置知识

problems/103.binary-tree-zigzag-level-order-traversal.md

@@ -1,40 +1,43 @@
-## 题目地址
-https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/
+## 题目地址(1031. 两个非重叠子数组的最大和)
+https://leetcode-cn.com/problems/maximum-sum-of-two-non-overlapping-subarrays/
 
 ## 题目描述
 
 ```
-Given an array A of non-negative integers, return the maximum sum of elements in two non-overlapping (contiguous) subarrays, which have lengths L and M.  (For clarification, the L-length subarray could occur before or after the M-length subarray.)
+给出非负整数数组 A ，返回两个非重叠（连续）子数组中元素的最大和，子数组的长度分别为 L 和 M。（这里需要澄清的是，长为 L 的子数组可以出现在长为 M 的子数组之前或之后。）
 
-Formally, return the largest V for which V = (A[i] + A[i+1] + ... + A[i+L-1]) + (A[j] + A[j+1] + ... + A[j+M-1]) and either:
+从形式上看，返回最大的 V，而 V = (A[i] + A[i+1] + ... + A[i+L-1]) + (A[j] + A[j+1] + ... + A[j+M-1]) 并满足下列条件之一：
 
-0 <= i < i + L - 1 < j < j + M - 1 < A.length, or
+ 
+
+0 <= i < i + L - 1 < j < j + M - 1 < A.length, 或
 0 <= j < j + M - 1 < i < i + L - 1 < A.length.
- 
+ 
 
-Example 1:
+示例 1：
 
-Input: A = [0,6,5,2,2,5,1,9,4], L = 1, M = 2
-Output: 20
-Explanation: One choice of subarrays is [9] with length 1, and [6,5] with length 2.
-Example 2:
+输入：A = [0,6,5,2,2,5,1,9,4], L = 1, M = 2
+输出：20
+解释：子数组的一种选择中，[9] 长度为 1，[6,5] 长度为 2。
+示例 2：
 
-Input: A = [3,8,1,3,2,1,8,9,0], L = 3, M = 2
-Output: 29
-Explanation: One choice of subarrays is [3,8,1] with length 3, and [8,9] with length 2.
-Example 3:
+输入：A = [3,8,1,3,2,1,8,9,0], L = 3, M = 2
+输出：29
+解释：子数组的一种选择中，[3,8,1] 长度为 3，[8,9] 长度为 2。
+示例 3：
 
-Input: A = [2,1,5,6,0,9,5,0,3,8], L = 4, M = 3
-Output: 31
-Explanation: One choice of subarrays is [5,6,0,9] with length 4, and [3,8] with length 3.
- 
+输入：A = [2,1,5,6,0,9,5,0,3,8], L = 4, M = 3
+输出：31
+解释：子数组的一种选择中，[5,6,0,9] 长度为 4，[0,3,8] 长度为 3。
+ 
 
-Note:
+提示：
 
 L >= 1
 M >= 1
 L + M <= A.length <= 1000
 0 <= A[i] <= 1000
+
 ```
 
 ## 前置知识