feat: update solutions to lc problems: No.1672,0072

Author: yanglbme

solution/0000-0099/0072.Edit Distance/README.md

@@ -66,6 +66,10 @@ i, j 分别从 1 开始遍历，判断 `word1[i - 1]` 与 `word2[j - 1]` 是否
 - 若 `word1[i - 1] == word2[j - 1]`，则 `dp[i][j] = dp[i - 1][j - 1]`。
 - 若 `word1[i - 1] != word2[j - 1]`，则 `dp[i][j] = min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]) + 1`。其中 `dp[i - 1][j] + 1` 对应插入操作，`dp[i][j - 1] + 1` 对应删除操作，`dp[i - 1][j - 1] + 1` 对应替换操作。取三者的最小值即可。
 
+递推公式如下：
+
+![](https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0072.Edit%20Distance/images/gif.gif)
+
 最后返回 `dp[m][n]` 即可。
 
 <!-- tabs:start -->

solution/0000-0099/0072.Edit Distance/README_EN.md

@@ -51,6 +51,8 @@ exection -> execution (insert 'u')
 
 Dynamic programming.
 
+![](https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0072.Edit%20Distance/images/gif.gif)
+
 <!-- tabs:start -->
 
 ### **Python3**

solution/0000-0099/0072.Edit Distance/images/gif.gif

@@ -63,10 +63,7 @@
 ```python
 class Solution:
     def maximumWealth(self, accounts: List[List[int]]) -> int:
-        res = 0
-        for account in accounts:
-            res = max(res, sum(account))
-        return res
+        return max(sum(account) for account in accounts)
 ```
 
 ### **Java**
@@ -96,13 +93,8 @@ class Solution {
 public:
     int maximumWealth(vector<vector<int>>& accounts) {
         int res = 0;
-        for (auto& account : accounts) {
-            int t = 0;
-            for (auto& money : account) {
-                t += money;
-            }
-            res = max(res, t);
-        }
+        for (auto& account : accounts)
+            res = max(res, accumulate(account.begin(), account.end(), 0));
         return res;
     }
 };

solution/1100-1199/1143.Longest Common Subsequence/images/CodeCogsEqn.gif

@@ -58,10 +58,7 @@ The 2nd customer is the richest with a wealth of 10.</pre>
 ```python
 class Solution:
     def maximumWealth(self, accounts: List[List[int]]) -> int:
-        res = 0
-        for account in accounts:
-            res = max(res, sum(account))
-        return res
+        return max(sum(account) for account in accounts)
 ```
 
 ### **Java**
@@ -89,13 +86,8 @@ class Solution {
 public:
     int maximumWealth(vector<vector<int>>& accounts) {
         int res = 0;
-        for (auto& account : accounts) {
-            int t = 0;
-            for (auto& money : account) {
-                t += money;
-            }
-            res = max(res, t);
-        }
+        for (auto& account : accounts)
+            res = max(res, accumulate(account.begin(), account.end(), 0));
         return res;
     }
 };

solution/1600-1699/1672.Richest Customer Wealth/README.md

@@ -2,13 +2,8 @@ class Solution {
 public:
     int maximumWealth(vector<vector<int>>& accounts) {
         int res = 0;
-        for (auto& account : accounts) {
-            int t = 0;
-            for (auto& money : account) {
-                t += money;
-            }
-            res = max(res, t);
-        }
+        for (auto& account : accounts)
+            res = max(res, accumulate(account.begin(), account.end(), 0));
         return res;
     }
 };

solution/1600-1699/1672.Richest Customer Wealth/README_EN.md

@@ -1,6 +1,3 @@
 class Solution:
     def maximumWealth(self, accounts: List[List[int]]) -> int:
-        res = 0
-        for account in accounts:
-            res = max(res, sum(account))
-        return res
+        return max(sum(account) for account in accounts)