Skip to content

Commit 5cde1e5

Browse files
author
Shuo
authored
Merge pull request #653 from openset/develop
Add: problem 1194
2 parents c5b88c0 + bb28427 commit 5cde1e5

File tree

10 files changed

+61
-15
lines changed

10 files changed

+61
-15
lines changed

‎README.md

+2
Original file line numberDiff line numberDiff line change
@@ -54,6 +54,8 @@ LeetCode Problems' Solutions
5454

5555
| # | Title | Solution | Difficulty |
5656
| :-: | - | - | :-: |
57+
| <span id="1194">1194</span> | [Tournament Winners](https://leetcode.com/problems/tournament-winners) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/tournament-winners) | Hard |
58+
| <span id="1193">1193</span> | [Monthly Transactions I](https://leetcode.com/problems/monthly-transactions-i) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i) | Medium |
5759
| <span id="1192">1192</span> | [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network "查找集群内的「关键连接」") | [Go](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network) | Hard |
5860
| <span id="1191">1191</span> | [K-Concatenation Maximum Sum](https://leetcode.com/problems/k-concatenation-maximum-sum "K 次串联后最大子数组之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum) | Medium |
5961
| <span id="1190">1190</span> | [Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses "反转每对括号间的子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-substrings-between-each-pair-of-parentheses) | Medium |

‎problems/critical-connections-in-a-network/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77

88
[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum "K-Concatenation Maximum Sum")
99

10-
Next >
10+
[Next >](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I")
1111

1212
## 1192. Critical Connections in a Network (Hard)
1313

‎problems/day-of-the-week/README.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
22
<!--+----------------------------------------------------------------------+-->
3-
<!--|@author Openset <[email protected]> |-->
3+
<!--|@author openset <[email protected]> |-->
44
<!--|@link https://github.com/openset |-->
55
<!--|@home https://github.com/openset/leetcode |-->
66
<!--+----------------------------------------------------------------------+-->
@@ -46,9 +46,6 @@
4646
<li>The given dates are valid&nbsp;dates between the years <code>1971</code> and <code>2100</code>.</li>
4747
</ul>
4848

49-
### Related Topics
50-
[[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
51-
5249
### Hints
5350
<details>
5451
<summary>Hint 1</summary>

‎problems/distance-between-bus-stops/README.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
22
<!--+----------------------------------------------------------------------+-->
3-
<!--|@author Openset <[email protected]> |-->
3+
<!--|@author openset <[email protected]> |-->
44
<!--|@link https://github.com/openset |-->
55
<!--|@home https://github.com/openset/leetcode |-->
66
<!--+----------------------------------------------------------------------+-->
@@ -61,9 +61,6 @@
6161
<li><code>0 &lt;= distance[i] &lt;= 10^4</code></li>
6262
</ul>
6363

64-
### Related Topics
65-
[[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
66-
6764
### Hints
6865
<details>
6966
<summary>Hint 1</summary>

‎problems/maximum-number-of-ones/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
22
<!--+----------------------------------------------------------------------+-->
3-
<!--|@author Openset <[email protected]> |-->
3+
<!--|@author openset <[email protected]> |-->
44
<!--|@link https://github.com/openset |-->
55
<!--|@home https://github.com/openset/leetcode |-->
66
<!--+----------------------------------------------------------------------+-->
@@ -14,8 +14,8 @@
1414

1515

1616
### Related Topics
17-
[[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
1817
[[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)]
18+
[[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
1919

2020
### Hints
2121
<details>

‎problems/maximum-subarray-sum-with-one-deletion/README.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
22
<!--+----------------------------------------------------------------------+-->
3-
<!--|@author Openset <[email protected]> |-->
3+
<!--|@author openset <[email protected]> |-->
44
<!--|@link https://github.com/openset |-->
55
<!--|@home https://github.com/openset/leetcode |-->
66
<!--+----------------------------------------------------------------------+-->
@@ -47,9 +47,6 @@
4747
<li><code>-10^4 &lt;= arr[i] &lt;= 10^4</code></li>
4848
</ul>
4949

50-
### Related Topics
51-
[[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]
52-
5350
### Hints
5451
<details>
5552
<summary>Hint 1</summary>

‎problems/monthly-transactions-i/README.md

+14
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <[email protected]> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network "Critical Connections in a Network")
9+
　　　　　　　　　　　　　　　　
10+
[Next >](https://github.com/openset/leetcode/tree/master/problems/tournament-winners "Tournament Winners")
11+
12+
## 1193. Monthly Transactions I (Medium)
13+
14+

‎problems/monthly-transactions-i/mysql_schemas.sql

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
create table if not exists Transactions (id int, country varchar(4), state enum('approved', 'declined'), amount int, trans_date date);
2+
Truncate table Transactions;
3+
insert into Transactions (id, country, state, amount, trans_date) values ('121', 'US', 'approved', '1000', '2018-12-18');
4+
insert into Transactions (id, country, state, amount, trans_date) values ('122', 'US', 'declined', '2000', '2018-12-19');
5+
insert into Transactions (id, country, state, amount, trans_date) values ('123', 'US', 'approved', '2000', '2019-01-01');
6+
insert into Transactions (id, country, state, amount, trans_date) values ('124', 'DE', 'approved', '2000', '2019-01-07');

‎problems/tournament-winners/README.md

+14
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <[email protected]> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I")
9+
　　　　　　　　　　　　　　　　
10+
Next >
11+
12+
## 1194. Tournament Winners (Hard)
13+
14+

‎problems/tournament-winners/mysql_schemas.sql

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
Create table If Not Exists Players (player_id int, group_id int);
2+
Create table If Not Exists Matches (match_id int, first_player int, second_player int, first_score int, second_score int)
3+
;
4+
Truncate table Players;
5+
insert into Players (player_id, group_id) values ('10', '2');
6+
insert into Players (player_id, group_id) values ('15', '1');
7+
insert into Players (player_id, group_id) values ('20', '3');
8+
insert into Players (player_id, group_id) values ('25', '1');
9+
insert into Players (player_id, group_id) values ('30', '1');
10+
insert into Players (player_id, group_id) values ('35', '2');
11+
insert into Players (player_id, group_id) values ('40', '3');
12+
insert into Players (player_id, group_id) values ('45', '1');
13+
insert into Players (player_id, group_id) values ('50', '2');
14+
Truncate table Matches;
15+
insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('1', '15', '45', '3', '0');
16+
insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('2', '30', '25', '1', '2');
17+
insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('3', '30', '15', '2', '0');
18+
insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('4', '40', '20', '5', '2');
19+
insert into Matches (match_id, first_player, second_player, first_score, second_score) values ('5', '35', '50', '1', '1');

0 commit comments

Comments
 (0)