chore: update lc problems (doocs#1093)

Author: yanglbme

solution/0300-0399/0375.Guess Number Higher or Lower II/README.md

@@ -27,21 +27,21 @@
 <strong>输出：</strong>16
 <strong>解释：</strong>制胜策略如下：
 - 数字范围是 [1,10] 。你先猜测数字为 7 。
-&nbsp;   - 如果这是我选中的数字，你的总费用为 $0 。否则，你需要支付 $7 。
+&nbsp;   - 如果这是我选中的数字，你的总费用为 0 。否则，你需要支付 7 。
 &nbsp;   - 如果我的数字更大，则下一步需要猜测的数字范围是 [8,10] 。你可以猜测数字为 9 。
-&nbsp;       - 如果这是我选中的数字，你的总费用为 $7 。否则，你需要支付 $9 。
-&nbsp;       - 如果我的数字更大，那么这个数字一定是 10 。你猜测数字为 10 并赢得游戏，总费用为 $7 + $9 = $16 。
-&nbsp;       - 如果我的数字更小，那么这个数字一定是 8 。你猜测数字为 8 并赢得游戏，总费用为 $7 + $9 = $16 。
+&nbsp;       - 如果这是我选中的数字，你的总费用为 7 。否则，你需要支付 9 。
+&nbsp;       - 如果我的数字更大，那么这个数字一定是 10 。你猜测数字为 10 并赢得游戏，总费用为 7 + 9 = 16 。
+&nbsp;       - 如果我的数字更小，那么这个数字一定是 8 。你猜测数字为 8 并赢得游戏，总费用为 7 + 9 = 16 。
 &nbsp;   - 如果我的数字更小，则下一步需要猜测的数字范围是 [1,6] 。你可以猜测数字为 3 。
-&nbsp;       - 如果这是我选中的数字，你的总费用为 $7 。否则，你需要支付 $3 。
+&nbsp;       - 如果这是我选中的数字，你的总费用为 7 。否则，你需要支付 3 。
 &nbsp;       - 如果我的数字更大，则下一步需要猜测的数字范围是 [4,6] 。你可以猜测数字为 5 。
-&nbsp;           - 如果这是我选中的数字，你的总费用为 $7 + $3 = $10 。否则，你需要支付 $5 。
-&nbsp;           - 如果我的数字更大，那么这个数字一定是 6 。你猜测数字为 6 并赢得游戏，总费用为 $7 + $3 + $5 = $15 。
-&nbsp;           - 如果我的数字更小，那么这个数字一定是 4 。你猜测数字为 4 并赢得游戏，总费用为 $7 + $3 + $5 = $15 。
+&nbsp;           - 如果这是我选中的数字，你的总费用为 7 + 3 = 10 。否则，你需要支付 5 。
+&nbsp;           - 如果我的数字更大，那么这个数字一定是 6 。你猜测数字为 6 并赢得游戏，总费用为 7 + 3 + 5 = 15 。
+&nbsp;           - 如果我的数字更小，那么这个数字一定是 4 。你猜测数字为 4 并赢得游戏，总费用为 7 + 3 + 5 = 15 。
 &nbsp;       - 如果我的数字更小，则下一步需要猜测的数字范围是 [1,2] 。你可以猜测数字为 1 。
-&nbsp;           - 如果这是我选中的数字，你的总费用为 $7 + $3 = $10 。否则，你需要支付 $1 。
-&nbsp;           - 如果我的数字更大，那么这个数字一定是 2 。你猜测数字为 2 并赢得游戏，总费用为 $7 + $3 + $1 = $11 。
-在最糟糕的情况下，你需要支付 $16 。因此，你只需要 $16 就可以确保自己赢得游戏。
+&nbsp;           - 如果这是我选中的数字，你的总费用为 7 + 3 = 10 。否则，你需要支付 1 。
+&nbsp;           - 如果我的数字更大，那么这个数字一定是 2 。你猜测数字为 2 并赢得游戏，总费用为 7 + 3 + 1 = 11 。
+在最糟糕的情况下，你需要支付 16 。因此，你只需要 16 就可以确保自己赢得游戏。
 </pre>
 
 <p><strong>示例 2：</strong></p>
@@ -59,9 +59,9 @@
 <strong>输出：</strong>1
 <strong>解释：</strong>有两个可能的数字 1 和 2 。
 - 你可以先猜 1 。
-&nbsp;   - 如果这是我选中的数字，你的总费用为 $0 。否则，你需要支付 $1 。
-&nbsp;   - 如果我的数字更大，那么这个数字一定是 2 。你猜测数字为 2 并赢得游戏，总费用为 $1 。
-最糟糕的情况下，你需要支付 $1 。
+&nbsp;   - 如果这是我选中的数字，你的总费用为 0 。否则，你需要支付 1 。
+&nbsp;   - 如果我的数字更大，那么这个数字一定是 2 。你猜测数字为 2 并赢得游戏，总费用为 1 。
+最糟糕的情况下，你需要支付 1 。
 </pre>
 
 <p>&nbsp;</p>

solution/0300-0399/0375.Guess Number Higher or Lower II/README_EN.md

@@ -24,21 +24,21 @@
 <strong>Output:</strong> 16
 <strong>Explanation:</strong> The winning strategy is as follows:
 - The range is [1,10]. Guess 7.
-&nbsp;   - If this is my number, your total is $0. Otherwise, you pay $7.
+&nbsp;   - If this is my number, your total is 0. Otherwise, you pay 7.
 &nbsp;   - If my number is higher, the range is [8,10]. Guess 9.
-&nbsp;       - If this is my number, your total is $7. Otherwise, you pay $9.
-&nbsp;       - If my number is higher, it must be 10. Guess 10. Your total is $7 + $9 = $16.
-&nbsp;       - If my number is lower, it must be 8. Guess 8. Your total is $7 + $9 = $16.
+&nbsp;       - If this is my number, your total is 7. Otherwise, you pay 9.
+&nbsp;       - If my number is higher, it must be 10. Guess 10. Your total is 7 + 9 = 16.
+&nbsp;       - If my number is lower, it must be 8. Guess 8. Your total is 7 + 9 = 16.
 &nbsp;   - If my number is lower, the range is [1,6]. Guess 3.
-&nbsp;       - If this is my number, your total is $7. Otherwise, you pay $3.
+&nbsp;       - If this is my number, your total is 7. Otherwise, you pay 3.
 &nbsp;       - If my number is higher, the range is [4,6]. Guess 5.
-&nbsp;           - If this is my number, your total is $7 + $3 = $10. Otherwise, you pay $5.
-&nbsp;           - If my number is higher, it must be 6. Guess 6. Your total is $7 + $3 + $5 = $15.
-&nbsp;           - If my number is lower, it must be 4. Guess 4. Your total is $7 + $3 + $5 = $15.
+&nbsp;           - If this is my number, your total is 7 + 3 = 10. Otherwise, you pay 5.
+&nbsp;           - If my number is higher, it must be 6. Guess 6. Your total is 7 + 3 + 5 = 15.
+&nbsp;           - If my number is lower, it must be 4. Guess 4. Your total is 7 + 3 + 5 = 15.
 &nbsp;       - If my number is lower, the range is [1,2]. Guess 1.
-&nbsp;           - If this is my number, your total is $7 + $3 = $10. Otherwise, you pay $1.
-&nbsp;           - If my number is higher, it must be 2. Guess 2. Your total is $7 + $3 + $1 = $11.
-The worst case in all these scenarios is that you pay $16. Hence, you only need $16 to guarantee a win.
+&nbsp;           - If this is my number, your total is 7 + 3 = 10. Otherwise, you pay 1.
+&nbsp;           - If my number is higher, it must be 2. Guess 2. Your total is 7 + 3 + 1 = 11.
+The worst case in all these scenarios is that you pay 16. Hence, you only need 16 to guarantee a win.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -56,9 +56,9 @@ The worst case in all these scenarios is that you pay $16. Hence, you only need
 <strong>Output:</strong> 1
 <strong>Explanation:</strong>&nbsp;There are two possible numbers, 1 and 2.
 - Guess 1.
-&nbsp;   - If this is my number, your total is $0. Otherwise, you pay $1.
-&nbsp;   - If my number is higher, it must be 2. Guess 2. Your total is $1.
-The worst case is that you pay $1.
+&nbsp;   - If this is my number, your total is 0. Otherwise, you pay 1.
+&nbsp;   - If my number is higher, it must be 2. Guess 2. Your total is 1.
+The worst case is that you pay 1.
 </pre>
 
 <p>&nbsp;</p>

solution/0400-0499/0465.Optimal Account Balancing/README.md

@@ -6,7 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给你一个表示交易的数组 <code>transactions</code> ，其中 <code>transactions[i] = [from<sub>i</sub>, to<sub>i</sub>, amount<sub>i</sub>]</code> 表示 <code>ID = from<sub>i</sub></code> 的人给&nbsp;<code>ID = to<sub>i</sub></code> 的人共计 <code>amount<sub>i</sub> $</code> 。</p>
+<p>给你一个表示交易的数组 <code>transactions</code> ，其中 <code>transactions[i] = [from<sub>i</sub>, to<sub>i</sub>, amount<sub>i</sub>]</code> 表示 <code>ID = from<sub>i</sub></code> 的人给&nbsp;<code>ID = to<sub>i</sub></code> 的人共计 <code>amount<sub>i</sub> </code> 。</p>
 
 <p>请你计算并返回还清所有债务的最小交易笔数。</p>
 
@@ -18,21 +18,21 @@
 <strong>输入：</strong>transactions = [[0,1,10],[2,0,5]]
 <strong>输出：</strong>2
 <strong>解释：</strong>
-#0 给 #1 $10 。
-#2 给 #0 $5 。
-需要进行两笔交易。一种结清债务的方式是 #1 给 #0 和 #2 各 $5 。</pre>
+#0 给 #1 10 。
+#2 给 #0 5 。
+需要进行两笔交易。一种结清债务的方式是 #1 给 #0 和 #2 各 5 。</pre>
 
 <p><strong class="example">示例 2：</strong></p>
 
 <pre>
 <strong>输入：</strong>transactions = [[0,1,10],[1,0,1],[1,2,5],[2,0,5]]
 <strong>输出：</strong>1
 <strong>解释：</strong>
-#0 给 #1 $10 。
-#1 给 #0 $1 。
-#1 给 #2 $5 。
-#2 给 #0 $5 。
-因此，#1 只需要给 #0 $4 ，所有的债务即可还清。
+#0 给 #1 10 。
+#1 给 #0 1 。
+#1 给 #2 5 。
+#2 给 #0 5 。
+因此，#1 只需要给 #0 4 ，所有的债务即可还清。
 </pre>
 
 <p>&nbsp;</p>

solution/0400-0499/0465.Optimal Account Balancing/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>You are given an array of transactions <code>transactions</code> where <code>transactions[i] = [from<sub>i</sub>, to<sub>i</sub>, amount<sub>i</sub>]</code> indicates that the person with <code>ID = from<sub>i</sub></code> gave <code>amount<sub>i</sub> $</code> to the person with <code>ID = to<sub>i</sub></code>.</p>
+<p>You are given an array of transactions <code>transactions</code> where <code>transactions[i] = [from<sub>i</sub>, to<sub>i</sub>, amount<sub>i</sub>]</code> indicates that the person with <code>ID = from<sub>i</sub></code> gave <code>amount<sub>i</sub> </code> to the person with <code>ID = to<sub>i</sub></code>.</p>
 
 <p>Return <em>the minimum number of transactions required to settle the debt</em>.</p>
 
@@ -15,9 +15,9 @@
 <strong>Input:</strong> transactions = [[0,1,10],[2,0,5]]
 <strong>Output:</strong> 2
 <strong>Explanation:</strong>
-Person #0 gave person #1 $10.
-Person #2 gave person #0 $5.
-Two transactions are needed. One way to settle the debt is person #1 pays person #0 and #2 $5 each.
+Person #0 gave person #1 10.
+Person #2 gave person #0 5.
+Two transactions are needed. One way to settle the debt is person #1 pays person #0 and #2 5 each.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -26,11 +26,11 @@ Two transactions are needed. One way to settle the debt is person #1 pays person
 <strong>Input:</strong> transactions = [[0,1,10],[1,0,1],[1,2,5],[2,0,5]]
 <strong>Output:</strong> 1
 <strong>Explanation:</strong>
-Person #0 gave person #1 $10.
-Person #1 gave person #0 $1.
-Person #1 gave person #2 $5.
-Person #2 gave person #0 $5.
-Therefore, person #1 only need to give person #0 $4, and all debt is settled.
+Person #0 gave person #1 10.
+Person #1 gave person #0 1.
+Person #1 gave person #2 5.
+Person #2 gave person #0 5.
+Therefore, person #1 only need to give person #0 4, and all debt is settled.
 </pre>
 
 <p>&nbsp;</p>

solution/0600-0699/0638.Shopping Offers/README_EN.md

@@ -18,21 +18,21 @@
 <pre>
 <strong>Input:</strong> price = [2,5], special = [[3,0,5],[1,2,10]], needs = [3,2]
 <strong>Output:</strong> 14
-<strong>Explanation:</strong> There are two kinds of items, A and B. Their prices are $2 and $5 respectively. 
-In special offer 1, you can pay $5 for 3A and 0B
-In special offer 2, you can pay $10 for 1A and 2B. 
-You need to buy 3A and 2B, so you may pay $10 for 1A and 2B (special offer #2), and $4 for 2A.
+<strong>Explanation:</strong> There are two kinds of items, A and B. Their prices are 2 and 5 respectively. 
+In special offer 1, you can pay 5 for 3A and 0B
+In special offer 2, you can pay 10 for 1A and 2B. 
+You need to buy 3A and 2B, so you may pay 10 for 1A and 2B (special offer #2), and 4 for 2A.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> price = [2,3,4], special = [[1,1,0,4],[2,2,1,9]], needs = [1,2,1]
 <strong>Output:</strong> 11
-<strong>Explanation:</strong> The price of A is $2, and $3 for B, $4 for C. 
-You may pay $4 for 1A and 1B, and $9 for 2A ,2B and 1C. 
-You need to buy 1A ,2B and 1C, so you may pay $4 for 1A and 1B (special offer #1), and $3 for 1B, $4 for 1C. 
-You cannot add more items, though only $9 for 2A ,2B and 1C.
+<strong>Explanation:</strong> The price of A is 2, and 3 for B, 4 for C. 
+You may pay 4 for 1A and 1B, and 9 for 2A ,2B and 1C. 
+You need to buy 1A ,2B and 1C, so you may pay 4 for 1A and 1B (special offer #1), and 3 for 1B, 4 for 1C. 
+You cannot add more items, though only 9 for 2A ,2B and 1C.
 </pre>
 
 <p>&nbsp;</p>

solution/0800-0899/0860.Lemonade Change/README.md

@@ -57,7 +57,7 @@
 
 从前往后遍历账单数组 `bills`，如果当前账单是 5 美元，那么直接收下即可；如果当前账单是 10 美元，那么需要找零 5 美元；如果当前账单是 20 美元，那么需要找零 15 美元，此时有两种找零方式：找零 1 张 10 美元 + 1 张 5 美元；找零 3 张 5 美元。如果找零失败，直接返回 `false`。
 
-时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为账单数组 `bills` 的长度。
+时间复杂度 O(n)，空间复杂度 O(1)。其中 n 为账单数组 `bills` 的长度。
 
 <!-- tabs:start -->
 

solution/0800-0899/0860.Lemonade Change/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>At a lemonade stand, each lemonade costs <code>$5</code>. Customers are standing in a queue to buy from you and order one at a time (in the order specified by bills). Each customer will only buy one lemonade and pay with either a <code>$5</code>, <code>$10</code>, or <code>$20</code> bill. You must provide the correct change to each customer so that the net transaction is that the customer pays <code>$5</code>.</p>
+<p>At a lemonade stand, each lemonade costs <code>5</code>. Customers are standing in a queue to buy from you and order one at a time (in the order specified by bills). Each customer will only buy one lemonade and pay with either a <code>5</code>, <code>10</code>, or <code>20</code> bill. You must provide the correct change to each customer so that the net transaction is that the customer pays <code>5</code>.</p>
 
 <p>Note that you do not have any change in hand at first.</p>
 
@@ -17,9 +17,9 @@
 <strong>Input:</strong> bills = [5,5,5,10,20]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> 
-From the first 3 customers, we collect three $5 bills in order.
-From the fourth customer, we collect a $10 bill and give back a $5.
-From the fifth customer, we give a $10 bill and a $5 bill.
+From the first 3 customers, we collect three 5 bills in order.
+From the fourth customer, we collect a 10 bill and give back a 5.
+From the fifth customer, we give a 10 bill and a 5 bill.
 Since all customers got correct change, we output true.
 </pre>
 
@@ -29,9 +29,9 @@ Since all customers got correct change, we output true.
 <strong>Input:</strong> bills = [5,5,10,10,20]
 <strong>Output:</strong> false
 <strong>Explanation:</strong> 
-From the first two customers in order, we collect two $5 bills.
-For the next two customers in order, we collect a $10 bill and give back a $5 bill.
-For the last customer, we can not give the change of $15 back because we only have two $10 bills.
+From the first two customers in order, we collect two 5 bills.
+For the next two customers in order, we collect a 10 bill and give back a 5 bill.
+For the last customer, we can not give the change of 15 back because we only have two 10 bills.
 Since not every customer received the correct change, the answer is false.
 </pre>
 

solution/0900-0999/0983.Minimum Cost For Tickets/README.md

@@ -29,10 +29,10 @@
 <strong>输出：</strong>11
 <strong>解释： </strong>
 例如，这里有一种购买通行证的方法，可以让你完成你的旅行计划：
-在第 1 天，你花了 costs[0] = $2 买了一张为期 1 天的通行证，它将在第 1 天生效。
-在第 3 天，你花了 costs[1] = $7 买了一张为期 7 天的通行证，它将在第 3, 4, ..., 9 天生效。
-在第 20 天，你花了 costs[0] = $2 买了一张为期 1 天的通行证，它将在第 20 天生效。
-你总共花了 $11，并完成了你计划的每一天旅行。
+在第 1 天，你花了 costs[0] = 2 买了一张为期 1 天的通行证，它将在第 1 天生效。
+在第 3 天，你花了 costs[1] = 7 买了一张为期 7 天的通行证，它将在第 3, 4, ..., 9 天生效。
+在第 20 天，你花了 costs[0] = 2 买了一张为期 1 天的通行证，它将在第 20 天生效。
+你总共花了 11，并完成了你计划的每一天旅行。
 </pre>
 
 <p><strong>示例 2：</strong></p>
@@ -42,9 +42,9 @@
 <strong>输出：</strong>17
 <strong>解释：
 </strong>例如，这里有一种购买通行证的方法，可以让你完成你的旅行计划： 
-在第 1 天，你花了 costs[2] = $15 买了一张为期 30 天的通行证，它将在第 1, 2, ..., 30 天生效。
-在第 31 天，你花了 costs[0] = $2 买了一张为期 1 天的通行证，它将在第 31 天生效。 
-你总共花了 $17，并完成了你计划的每一天旅行。
+在第 1 天，你花了 costs[2] = 15 买了一张为期 30 天的通行证，它将在第 1, 2, ..., 30 天生效。
+在第 31 天，你花了 costs[0] = 2 买了一张为期 1 天的通行证，它将在第 31 天生效。 
+你总共花了 17，并完成了你计划的每一天旅行。
 </pre>
 
 <p>&nbsp;</p>

solution/0900-0999/0983.Minimum Cost For Tickets/README_EN.md

@@ -29,10 +29,10 @@
 <strong>Input:</strong> days = [1,4,6,7,8,20], costs = [2,7,15]
 <strong>Output:</strong> 11
 <strong>Explanation:</strong> For example, here is one way to buy passes that lets you travel your travel plan:
-On day 1, you bought a 1-day pass for costs[0] = $2, which covered day 1.
-On day 3, you bought a 7-day pass for costs[1] = $7, which covered days 3, 4, ..., 9.
-On day 20, you bought a 1-day pass for costs[0] = $2, which covered day 20.
-In total, you spent $11 and covered all the days of your travel.
+On day 1, you bought a 1-day pass for costs[0] = 2, which covered day 1.
+On day 3, you bought a 7-day pass for costs[1] = 7, which covered days 3, 4, ..., 9.
+On day 20, you bought a 1-day pass for costs[0] = 2, which covered day 20.
+In total, you spent 11 and covered all the days of your travel.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -41,9 +41,9 @@ In total, you spent $11 and covered all the days of your travel.
 <strong>Input:</strong> days = [1,2,3,4,5,6,7,8,9,10,30,31], costs = [2,7,15]
 <strong>Output:</strong> 17
 <strong>Explanation:</strong> For example, here is one way to buy passes that lets you travel your travel plan:
-On day 1, you bought a 30-day pass for costs[2] = $15 which covered days 1, 2, ..., 30.
-On day 31, you bought a 1-day pass for costs[0] = $2 which covered day 31.
-In total, you spent $17 and covered all the days of your travel.
+On day 1, you bought a 30-day pass for costs[2] = 15 which covered days 1, 2, ..., 30.
+On day 31, you bought a 1-day pass for costs[0] = 2 which covered day 31.
+In total, you spent 17 and covered all the days of your travel.
 </pre>
 
 <p>&nbsp;</p>

solution/1500-1599/1511.Customer Order Frequency/README.md

@@ -57,7 +57,7 @@ Order_date 是订单发货的日期, 格式为('YYYY-MM-DD').</pre>
 
 <p>&nbsp;</p>
 
-<p>写一个 SQL 查询，报告在&nbsp;<strong>2020 年 6 月和 7 月&nbsp;</strong>每个月至少花费 $100 的客户的 customer_id 和 customer_name 。</p>
+<p>写一个 SQL 查询，报告在&nbsp;<strong>2020 年 6 月和 7 月&nbsp;</strong>每个月至少花费 100 的客户的 customer_id 和 customer_name 。</p>
 
 <p>以<strong>任意顺序</strong>返回结果表.</p>
 
@@ -109,9 +109,9 @@ Customers table:</code>
 | 1            | Winston    |
 +--------------+------------+ 
 解释：
-Winston 在2020年6月花费了$300(300 * 1), 在7月花费了$100(10 * 1 + 45 * 2).
-Jonathan 在2020年6月花费了$600(300 * 2), 在7月花费了$20(2 * 10).
-Moustafa 在2020年6月花费了$110 (10 * 2 + 45 * 2), 在7月花费了$0.</pre>
+Winston 在2020年6月花费了300(300 * 1), 在7月花费了100(10 * 1 + 45 * 2).
+Jonathan 在2020年6月花费了600(300 * 2), 在7月花费了20(2 * 10).
+Moustafa 在2020年6月花费了110 (10 * 2 + 45 * 2), 在7月花费了0.</pre>
 
 
 ## 解法