Merge pull request #676 from openset/develop

Add: new

Author: Shuo

README.md

@@ -62,6 +62,7 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="1204">1204</span> | [Last Person to Fit in the Elevator](https://leetcode.com/problems/last-person-to-fit-in-the-elevator) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/last-person-to-fit-in-the-elevator) | Medium |
 | <span id="1203">1203</span> | [Sort Items by Groups Respecting Dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies "项目管理") | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies) | Hard |
 | <span id="1202">1202</span> | [Smallest String With Swaps](https://leetcode.com/problems/smallest-string-with-swaps "交换字符串中的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-string-with-swaps) | Medium |
 | <span id="1201">1201</span> | [Ugly Number III](https://leetcode.com/problems/ugly-number-iii "丑数 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-iii) | Medium |

problems/last-person-to-fit-in-the-elevator/README.md

@@ -0,0 +1,14 @@
+<!--|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](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies "Sort Items by Groups Respecting Dependencies")
+　　　　　　　　　　　　　　　　
+Next >
+
+## [1204. Last Person to Fit in the Elevator (Medium)](https://leetcode.com/problems/last-person-to-fit-in-the-elevator "")
+
+

problems/last-person-to-fit-in-the-elevator/mysql_schemas.sql

@@ -0,0 +1,8 @@
+Create table If Not Exists Queue (person_id int, person_name varchar(30), weight int, turn int);
+Truncate table Queue;
+insert into Queue (person_id, person_name, weight, turn) values ('5', 'George Washington', '250', '1');
+insert into Queue (person_id, person_name, weight, turn) values ('4', 'Thomas Jefferson', '175', '5');
+insert into Queue (person_id, person_name, weight, turn) values ('3', 'John Adams', '350', '2');
+insert into Queue (person_id, person_name, weight, turn) values ('6', 'Thomas Jefferson', '400', '3');
+insert into Queue (person_id, person_name, weight, turn) values ('1', 'James Elephant', '500', '6');
+insert into Queue (person_id, person_name, weight, turn) values ('2', 'Will Johnliams', '200', '4');

problems/monthly-transactions-i/README.md

@@ -9,6 +9,6 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/tournament-winners "Tournament Winners")
 
-## [1193. Monthly Transactions I (Medium)](https://leetcode.com/problems/monthly-transactions-i "")
+## [1193. Monthly Transactions I (Medium)](https://leetcode.com/problems/monthly-transactions-i "每月交易 I")
 
 

problems/sort-items-by-groups-respecting-dependencies/README.md

@@ -7,7 +7,7 @@
 
 [< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-string-with-swaps "Smallest String With Swaps")
 
-Next >
+[Next >](https://github.com/openset/leetcode/tree/master/problems/last-person-to-fit-in-the-elevator "Last Person to Fit in the Elevator")
 
 ## [1203. Sort Items by Groups Respecting Dependencies (Hard)](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies "")
 

problems/ugly-number-iii/README.md

@@ -28,7 +28,7 @@
 <pre>
 <strong>Input:</strong> n = 4, a = 2, b = 3, c = 4
 <strong>Output:</strong> 6
-<strong>Explanation: </strong>The ugly numbers are 2, 3, 4, 6, 8, 9, 12... The 4th is 6.
+<strong>Explanation: </strong>The ugly numbers are 2, 3, 4, 6, 8, 9, 10, 12... The 4th is 6.
 </pre>
 
 <p><strong>Example 3:</strong></p>

tag/README.md

@@ -16,8 +16,8 @@
 | 9 | [Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md) | [贪心算法](https://openset.github.io/tags/greedy/) | | 10 | [Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md) | [双指针](https://openset.github.io/tags/two-pointers/) | 
 | 11 | [Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md) | [广度优先搜索](https://openset.github.io/tags/breadth-first-search/) | | 12 | [Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md) | [栈](https://openset.github.io/tags/stack/) | 
 | 13 | [Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md) | [回溯算法](https://openset.github.io/tags/backtracking/) | | 14 | [Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md) | [设计](https://openset.github.io/tags/design/) | 
-| 15 | [Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md) | [链表](https://openset.github.io/tags/linked-list/) | | 16 | [Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) | [排序](https://openset.github.io/tags/sort/) | 
-| 17 | [Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | [位运算](https://openset.github.io/tags/bit-manipulation/) | | 18 | [Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | [图](https://openset.github.io/tags/graph/) | 
+| 15 | [Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | [图](https://openset.github.io/tags/graph/) | | 16 | [Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md) | [链表](https://openset.github.io/tags/linked-list/) | 
+| 17 | [Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) | [排序](https://openset.github.io/tags/sort/) | | 18 | [Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | [位运算](https://openset.github.io/tags/bit-manipulation/) | 
 | 19 | [Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md) | [堆](https://openset.github.io/tags/heap/) | | 20 | [Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md) | [并查集](https://openset.github.io/tags/union-find/) | 
 | 21 | [Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md) | [Sliding Window](https://openset.github.io/tags/sliding-window/) | | 22 | [Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md) | [分治算法](https://openset.github.io/tags/divide-and-conquer/) | 
 | 23 | [Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md) | [字典树](https://openset.github.io/tags/trie/) | | 24 | [Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | [递归](https://openset.github.io/tags/recursion/) | 

tag/tags.json

@@ -69,6 +69,11 @@
 		"Slug": "design",
 		"TranslatedName": "设计"
 	},
+	{
+		"Name": "Graph",
+		"Slug": "graph",
+		"TranslatedName": "图"
+	},
 	{
 		"Name": "Linked List",
 		"Slug": "linked-list",
@@ -84,11 +89,6 @@
 		"Slug": "bit-manipulation",
 		"TranslatedName": "位运算"
 	},
-	{
-		"Name": "Graph",
-		"Slug": "graph",
-		"TranslatedName": "图"
-	},
 	{
 		"Name": "Heap",
 		"Slug": "heap",