Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

A: new #845

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
awesee merged 1 commit into master from develop
Nov 19, 2021
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
33 changes: 32 additions & 1 deletion README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -78,6 +78,37 @@ LeetCode Problems' Solutions

| # | Title | Solution | Difficulty |
| :-: | - | - | :-: |
| <span id="2076">2076</span> | [Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests "处理含限制条件的好友请求") | [Go](problems/process-restricted-friend-requests) | Hard |
| <span id="2075">2075</span> | [Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext "解码斜向换位密码") | [Go](problems/decode-the-slanted-ciphertext) | Medium |
| <span id="2074">2074</span> | [Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups "反转偶数长度组的节点") | [Go](problems/reverse-nodes-in-even-length-groups) | Medium |
| <span id="2073">2073</span> | [Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets "买票需要的时间") | [Go](problems/time-needed-to-buy-tickets) | Easy |
| <span id="2072">2072</span> | [The Winner University](https://leetcode.com/problems/the-winner-university) 🔒 | [MySQL](problems/the-winner-university) | Easy |
| <span id="2071">2071</span> | [Maximum Number of Tasks You Can Assign](https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign "你可以安排的最多任务数目") | [Go](problems/maximum-number-of-tasks-you-can-assign) | Hard |
| <span id="2070">2070</span> | [Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query "每一个查询的最大美丽值") | [Go](problems/most-beautiful-item-for-each-query) | Medium |
| <span id="2069">2069</span> | [Walking Robot Simulation II](https://leetcode.com/problems/walking-robot-simulation-ii "模拟行走机器人 II") | [Go](problems/walking-robot-simulation-ii) | Medium |
| <span id="2068">2068</span> | [Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent "检查两个字符串是否几乎相等") | [Go](problems/check-whether-two-strings-are-almost-equivalent) | Easy |
| <span id="2067">2067</span> | [Number of Equal Count Substrings](https://leetcode.com/problems/number-of-equal-count-substrings) 🔒 | [Go](problems/number-of-equal-count-substrings) | Medium |
| <span id="2066">2066</span> | [Account Balance](https://leetcode.com/problems/account-balance) 🔒 | [MySQL](problems/account-balance) | Medium |
| <span id="2065">2065</span> | [Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph "最大化一张图中的路径价值") | [Go](problems/maximum-path-quality-of-a-graph) | Hard |
| <span id="2064">2064</span> | [Minimized Maximum of Products Distributed to Any Store](https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store "分配给商店的最多商品的最小值") | [Go](problems/minimized-maximum-of-products-distributed-to-any-store) | Medium |
| <span id="2063">2063</span> | [Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings "所有子字符串中的元音") | [Go](problems/vowels-of-all-substrings) | Medium |
| <span id="2062">2062</span> | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string "统计字符串中的元音子字符串") | [Go](problems/count-vowel-substrings-of-a-string) | Easy |
| <span id="2061">2061</span> | [Number of Spaces Cleaning Robot Cleaned](https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned) 🔒 | [Go](problems/number-of-spaces-cleaning-robot-cleaned) | Medium |
| <span id="2060">2060</span> | [Check if an Original String Exists Given Two Encoded Strings](https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings "同源字符串检测") | [Go](problems/check-if-an-original-string-exists-given-two-encoded-strings) | Hard |
| <span id="2059">2059</span> | [Minimum Operations to Convert Number](https://leetcode.com/problems/minimum-operations-to-convert-number "转化数字的最小运算数") | [Go](problems/minimum-operations-to-convert-number) | Medium |
| <span id="2058">2058</span> | [Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points "找出临界点之间的最小和最大距离") | [Go](problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points) | Medium |
| <span id="2057">2057</span> | [Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value "值相等的最小索引") | [Go](problems/smallest-index-with-equal-value) | Easy |
| <span id="2056">2056</span> | [Number of Valid Move Combinations On Chessboard](https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard "棋盘上有效移动组合的数目") | [Go](problems/number-of-valid-move-combinations-on-chessboard) | Hard |
| <span id="2055">2055</span> | [Plates Between Candles](https://leetcode.com/problems/plates-between-candles "蜡烛之间的盘子") | [Go](problems/plates-between-candles) | Medium |
| <span id="2054">2054</span> | [Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events "两个最好的不重叠活动") | [Go](problems/two-best-non-overlapping-events) | Medium |
| <span id="2053">2053</span> | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array "数组中第 K 个独一无二的字符串") | [Go](problems/kth-distinct-string-in-an-array) | Easy |
| <span id="2052">2052</span> | [Minimum Cost to Separate Sentence Into Rows](https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows) 🔒 | [Go](problems/minimum-cost-to-separate-sentence-into-rows) | Medium |
| <span id="2051">2051</span> | [The Category of Each Member in the Store](https://leetcode.com/problems/the-category-of-each-member-in-the-store) 🔒 | [MySQL](problems/the-category-of-each-member-in-the-store) | Medium |
| <span id="2050">2050</span> | [Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii "并行课程 III") | [Go](problems/parallel-courses-iii) | Hard |
| <span id="2049">2049</span> | [Count Nodes With the Highest Score](https://leetcode.com/problems/count-nodes-with-the-highest-score "统计最高分的节点数目") | [Go](problems/count-nodes-with-the-highest-score) | Medium |
| <span id="2048">2048</span> | [Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number "下一个更大的数值平衡数") | [Go](problems/next-greater-numerically-balanced-number) | Medium |
| <span id="2047">2047</span> | [Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence "句子中的有效单词数") | [Go](problems/number-of-valid-words-in-a-sentence) | Easy |
| <span id="2046">2046</span> | [Sort Linked List Already Sorted Using Absolute Values](https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values) 🔒 | [Go](problems/sort-linked-list-already-sorted-using-absolute-values) | Medium |
| <span id="2045">2045</span> | [Second Minimum Time to Reach Destination](https://leetcode.com/problems/second-minimum-time-to-reach-destination "到达目的地的第二短时间") | [Go](problems/second-minimum-time-to-reach-destination) | Hard |
| <span id="2044">2044</span> | [Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets "统计按位或能得到最大值的子集数目") | [Go](problems/count-number-of-maximum-bitwise-or-subsets) | Medium |
| <span id="2043">2043</span> | [Simple Bank System](https://leetcode.com/problems/simple-bank-system "简易银行系统") | [Go](problems/simple-bank-system) | Medium |
Expand Down Expand Up @@ -158,7 +189,7 @@ LeetCode Problems' Solutions
| <span id="1968">1968</span> | [Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors "构造元素不等于两相邻元素平均值的数组") | [Go](problems/array-with-elements-not-equal-to-average-of-neighbors) | Medium |
| <span id="1967">1967</span> | [Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word "作为子字符串出现在单词中的字符串数目") | [Go](problems/number-of-strings-that-appear-as-substrings-in-word) | Easy |
| <span id="1966">1966</span> | [Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array) 🔒 | [Go](problems/binary-searchable-numbers-in-an-unsorted-array) | Medium |
| <span id="1965">1965</span> | [Employees With Missing Information](https://leetcode.com/problems/employees-with-missing-information) 🔒 | [MySQL](problems/employees-with-missing-information) | Easy |
| <span id="1965">1965</span> | [Employees With Missing Information](https://leetcode.com/problems/employees-with-missing-information "丢失信息的雇员") 🔒 | [MySQL](problems/employees-with-missing-information) | Easy |
| <span id="1964">1964</span> | [Find the Longest Valid Obstacle Course at Each Position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position "找出到每个位置为止最长的有效障碍赛跑路线") | [Go](problems/find-the-longest-valid-obstacle-course-at-each-position) | Hard |
| <span id="1963">1963</span> | [Minimum Number of Swaps to Make the String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced "使字符串平衡的最小交换次数") | [Go](problems/minimum-number-of-swaps-to-make-the-string-balanced) | Medium |
| <span id="1962">1962</span> | [Remove Stones to Minimize the Total](https://leetcode.com/problems/remove-stones-to-minimize-the-total "移除石子使总数最小") | [Go](problems/remove-stones-to-minimize-the-total) | Medium |
Expand Down
17 changes: 17 additions & 0 deletions problems/account-balance/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
<!--+----------------------------------------------------------------------+-->
<!--|@author openset <openset.wang@gmail.com> |-->
<!--|@link https://github.com/openset |-->
<!--|@home https://github.com/openset/leetcode |-->
<!--+----------------------------------------------------------------------+-->

[< Previous](../maximum-path-quality-of-a-graph "Maximum Path Quality of a Graph")

[Next >](../number-of-equal-count-substrings "Number of Equal Count Substrings")

## [2066. Account Balance (Medium)](https://leetcode.com/problems/account-balance "")



### Related Topics
[[Database](../../tag/database/README.md)]
7 changes: 7 additions & 0 deletions problems/account-balance/mysql_schemas.sql
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
Create table If Not Exists Transactions (account_id int, day date, type ENUM('Deposit', 'Withdraw'), amount int);
Truncate table Transactions;
insert into Transactions (account_id, day, type, amount) values ('1', '2021年11月07日', 'Deposit', '2000');
insert into Transactions (account_id, day, type, amount) values ('1', '2021年11月09日', 'Withdraw', '1000');
insert into Transactions (account_id, day, type, amount) values ('1', '2021年11月11日', 'Deposit', '3000');
insert into Transactions (account_id, day, type, amount) values ('2', '2021年12月07日', 'Deposit', '7000');
insert into Transactions (account_id, day, type, amount) values ('2', '2021年12月12日', 'Withdraw', '7000');
4 changes: 2 additions & 2 deletions problems/accounts-merge/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,8 +24,8 @@
<strong>Input:</strong> accounts = [[&quot;John&quot;,&quot;johnsmith@mail.com&quot;,&quot;john_newyork@mail.com&quot;],[&quot;John&quot;,&quot;johnsmith@mail.com&quot;,&quot;john00@mail.com&quot;],[&quot;Mary&quot;,&quot;mary@mail.com&quot;],[&quot;John&quot;,&quot;johnnybravo@mail.com&quot;]]
<strong>Output:</strong> [[&quot;John&quot;,&quot;john00@mail.com&quot;,&quot;john_newyork@mail.com&quot;,&quot;johnsmith@mail.com&quot;],[&quot;Mary&quot;,&quot;mary@mail.com&quot;],[&quot;John&quot;,&quot;johnnybravo@mail.com&quot;]]
<strong>Explanation:</strong>
The first and third John&#39;s are the same person as they have the common email &quot;johnsmith@mail.com&quot;.
The second John and Mary are different people as none of their email addresses are used by other accounts.
The first and second John&#39;s are the same person as they have the common email &quot;johnsmith@mail.com&quot;.
The third John and Mary are different people as none of their email addresses are used by other accounts.
We could return these lists in any order, for example the answer [[&#39;Mary&#39;, &#39;mary@mail.com&#39;], [&#39;John&#39;, &#39;johnnybravo@mail.com&#39;],
[&#39;John&#39;, &#39;john00@mail.com&#39;, &#39;john_newyork@mail.com&#39;, &#39;johnsmith@mail.com&#39;]] would still be accepted.
</pre>
Expand Down
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,3 +12,6 @@
## [1951. All the Pairs With the Maximum Number of Common Followers (Medium)](https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers "查询具有最多共同关注者的所有两两结对组")



### Related Topics
[[Database](../../tag/database/README.md)]
11 changes: 5 additions & 6 deletions problems/basic-calculator/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,25 +41,24 @@
<p><strong>Constraints:</strong></p>

<ul>
<li><code>1 &lt;= s.length &lt;= 3&nbsp;* 10<sup>5</sup></code></li>
<li><code>1 &lt;= s.length &lt;= 3* 10<sup>5</sup></code></li>
<li><code>s</code> consists of digits, <code>&#39;+&#39;</code>, <code>&#39;-&#39;</code>, <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code>, and <code>&#39; &#39;</code>.</li>
<li><code>s</code> represents a valid expression.</li>
<li><code>&#39;+&#39;</code> is not used as a unary operation.</li>
<li><code>&#39;-&#39;</code> could be used as a unary operation and in this case, it will not be used directly after a +ve or -ve signs (will be inside parentheses).</li>
<li><code>&#39;+&#39;</code> is <strong>not</strong> used as a unary operation (i.e., <code>&quot;+1&quot;</code> and <code>&quot;+(2 + 3)&quot;</code> is invalid).</li>
<li><code>&#39;-&#39;</code> could be used as a unary operation (i.e., <code>&quot;-1&quot;</code> and <code>&quot;-(2 + 3)&quot;</code> is valid).</li>
<li>There will be no two consecutive operators in the input.</li>
<li>Every number and running calculation will fit in a signed 32-bit integer.</li>
</ul>

### Related Topics
[[Math](../../tag/math/README.md)]
[[String](../../tag/string/README.md)]
[[Stack](../../tag/stack/README.md)]
[[Recursion](../../tag/recursion/README.md)]
[[Math](../../tag/math/README.md)]
[[String](../../tag/string/README.md)]

### Similar Questions
1. [Evaluate Reverse Polish Notation](../evaluate-reverse-polish-notation) (Medium)
1. [Basic Calculator II](../basic-calculator-ii) (Medium)
1. [Different Ways to Add Parentheses](../different-ways-to-add-parentheses) (Medium)
1. [Expression Add Operators](../expression-add-operators) (Hard)
1. [Basic Calculator III](../basic-calculator-iii) (Hard)
1. [The Score of Students Solving Math Expression](../the-score-of-students-solving-math-expression) (Hard)
5 changes: 3 additions & 2 deletions problems/binary-tree-maximum-path-sum/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@

<p>The <strong>path sum</strong> of a path is the sum of the node&#39;s values in the path.</p>

<p>Given the <code>root</code> of a binary tree, return <em>the maximum <strong>path sum</strong> of any path</em>.</p>
<p>Given the <code>root</code> of a binary tree, return <em>the maximum <strong>path sum</strong> of any <strong>non-empty</strong> path</em>.</p>

<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
Expand Down Expand Up @@ -43,13 +43,14 @@
</ul>

### Related Topics
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
[[Tree](../../tag/tree/README.md)]
[[Depth-First Search](../../tag/depth-first-search/README.md)]
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
[[Binary Tree](../../tag/binary-tree/README.md)]

### Similar Questions
1. [Path Sum](../path-sum) (Easy)
1. [Sum Root to Leaf Numbers](../sum-root-to-leaf-numbers) (Medium)
1. [Path Sum IV](../path-sum-iv) (Medium)
1. [Longest Univalue Path](../longest-univalue-path) (Medium)
1. [Time Needed to Inform All Employees](../time-needed-to-inform-all-employees) (Medium)
2 changes: 1 addition & 1 deletion problems/building-boxes/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -61,9 +61,9 @@ These boxes are placed in the corner of the room, where the corner is on the bac
</ul>

### Related Topics
[[Greedy](../../tag/greedy/README.md)]
[[Math](../../tag/math/README.md)]
[[Binary Search](../../tag/binary-search/README.md)]
[[Greedy](../../tag/greedy/README.md)]

### Hints
<details>
Expand Down
40 changes: 34 additions & 6 deletions problems/bulb-switcher-ii/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,33 +20,60 @@
<li><strong>Button 4:</strong> Flips the status of all the bulbs with a label <code>j = 3k + 1</code> where <code>k = 0, 1, 2, ...</code> (i.e., <code>1, 4, 7, 10, ...</code>).</li>
</ul>

<p>You will press one of the four mentioned buttons exactly <code>presses</code> times.</p>
<p>You must make <strong>exactly</strong> <code>presses</code> button presses in total. For each press, you may pick <strong>any</strong> of the four buttons to press.</p>

<p>Given the two integers <code>n</code> and <code>presses</code>, return <em>the number of <strong>different statuses</strong> after pressing the four buttons <strong>exactly</strong> </em><code>presses</code><em> times</em>.</p>
<p>Given the two integers <code>n</code> and <code>presses</code>, return <em>the number of <strong>different possible statuses</strong> after performing all </em><code>presses</code><em> button presses</em>.</p>

<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 1, presses = 1
<strong>Output:</strong> 2
<strong>Explanation:</strong> Status can be: [on], [off].
<strong>Explanation:</strong> Status can be:
- [off] by pressing button 1
- [on] by pressing button 2
</pre>

<p><strong>Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 2, presses = 1
<strong>Output:</strong> 3
<strong>Explanation:</strong> Status can be: [on, off], [off, on], [off, off].
<strong>Explanation:</strong> Status can be:
- [off, off] by pressing button 1
- [on, off] by pressing button 2
- [off, on] by pressing button 3
</pre>

<p><strong>Example 3:</strong></p>

<pre>
<strong>Input:</strong> n = 3, presses = 1
<strong>Output:</strong> 4
<strong>Explanation:</strong> Status can be: [off, on, off], [on, off, on], [off, off, off], [off, on, on].
<strong>Explanation:</strong> Status can be:
- [off, off, off] by pressing button 1
- [off, on, off] by pressing button 2
- [on, off, on] by pressing button 3
- [off, on, on] by pressing button 4
</pre>

<p><strong>Example 4:</strong></p>

<pre>
<strong>Input:</strong> n = 1, presses = 0
<strong>Output:</strong> 1
<strong>Explanation:</strong> Status can only be [on] since you cannot press any of the buttons.
</pre>

<p><strong>Example 5:</strong></p>

<pre>
<strong>Input:</strong> n = 1, presses = 2
<strong>Output:</strong> 2
<strong>Explanation:</strong> Status can be:
- [off] by pressing button 1 then button 1 again
- [on] by pressing button 1 then button 2
</pre>

<p>&nbsp;</p>
Expand All @@ -58,10 +85,11 @@
</ul>

### Related Topics
[[Math](../../tag/math/README.md)]
[[Bit Manipulation](../../tag/bit-manipulation/README.md)]
[[Depth-First Search](../../tag/depth-first-search/README.md)]
[[Breadth-First Search](../../tag/breadth-first-search/README.md)]
[[Math](../../tag/math/README.md)]

### Similar Questions
1. [Bulb Switcher](../bulb-switcher) (Medium)
1. [Bulb Switcher III](../bulb-switcher-iii) (Medium)
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,9 +44,6 @@
[[Array](../../tag/array/README.md)]
[[Sorting](../../tag/sorting/README.md)]

### Similar Questions
1. [Arithmetic Subarrays](../arithmetic-subarrays) (Medium)

### Hints
<details>
<summary>Hint 1</summary>
Expand Down
Loading

AltStyle によって変換されたページ (->オリジナル) /