You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: README.md
+14-3
Original file line number
Diff line number
Diff line change
@@ -62,7 +62,18 @@ LeetCode Problems' Solutions
62
62
63
63
| # | Title | Solution | Difficulty |
64
64
| :-: | - | - | :-: |
65
-
| <spanid="1225">1225</span> |[Report Contiguous Dates](https://leetcode.com/problems/report-contiguous-dates)|[MySQL](https://github.com/openset/leetcode/tree/master/problems/report-contiguous-dates)| Hard |
65
+
| <spanid="1236">1236</span> |[Web Crawler](https://leetcode.com/problems/web-crawler) 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/web-crawler)| Medium |
66
+
| <spanid="1235">1235</span> |[Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling"规划兼职工作")|[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-profit-in-job-scheduling)| Hard |
67
+
| <spanid="1234">1234</span> |[Replace the Substring for Balanced String](https://leetcode.com/problems/replace-the-substring-for-balanced-string"替换子串得到平衡字符串")|[Go](https://github.com/openset/leetcode/tree/master/problems/replace-the-substring-for-balanced-string)| Medium |
68
+
| <spanid="1233">1233</span> |[Remove Sub-Folders from the Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem"删除子文件夹")|[Go](https://github.com/openset/leetcode/tree/master/problems/remove-sub-folders-from-the-filesystem)| Medium |
69
+
| <spanid="1232">1232</span> |[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line"缀点成线")|[Go](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-straight-line)| Easy |
70
+
| <spanid="1231">1231</span> |[Divide Chocolate](https://leetcode.com/problems/divide-chocolate"分享巧克力") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/divide-chocolate)| Hard |
71
+
| <spanid="1230">1230</span> |[Toss Strange Coins](https://leetcode.com/problems/toss-strange-coins"抛掷硬币") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/toss-strange-coins)| Medium |
72
+
| <spanid="1229">1229</span> |[Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler"安排会议日程") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/meeting-scheduler)| Medium |
73
+
| <spanid="1228">1228</span> |[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression"等差数列中缺失的数字") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/missing-number-in-arithmetic-progression)| Easy |
74
+
| <spanid="1227">1227</span> |[Airplane Seat Assignment Probability](https://leetcode.com/problems/airplane-seat-assignment-probability)|[Go](https://github.com/openset/leetcode/tree/master/problems/airplane-seat-assignment-probability)| Medium |
75
+
| <spanid="1226">1226</span> |[The Dining Philosophers](https://leetcode.com/problems/the-dining-philosophers)|[Go](https://github.com/openset/leetcode/tree/master/problems/the-dining-philosophers)| Medium |
76
+
| <spanid="1225">1225</span> |[Report Contiguous Dates](https://leetcode.com/problems/report-contiguous-dates) 🔒 |[MySQL](https://github.com/openset/leetcode/tree/master/problems/report-contiguous-dates)| Hard |
66
77
| <spanid="1224">1224</span> |[Maximum Equal Frequency](https://leetcode.com/problems/maximum-equal-frequency"最大相等频率")|[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-equal-frequency)| Hard |
67
78
| <spanid="1223">1223</span> |[Dice Roll Simulation](https://leetcode.com/problems/dice-roll-simulation"掷骰子模拟")|[Go](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation)| Medium |
68
79
| <spanid="1222">1222</span> |[Queens That Can Attack the King](https://leetcode.com/problems/queens-that-can-attack-the-king"可以攻击国王的皇后")|[Go](https://github.com/openset/leetcode/tree/master/problems/queens-that-can-attack-the-king)| Medium |
@@ -99,7 +110,7 @@ LeetCode Problems' Solutions
99
110
| <spanid="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 |
100
111
| <spanid="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 |
101
112
| <spanid="1189">1189</span> |[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons"“气球” 的最大数量")|[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-balloons)| Easy |
102
-
| <spanid="1188">1188</span> |[Design Bounded Blocking Queue](https://leetcode.com/problems/design-bounded-blocking-queue) 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/design-bounded-blocking-queue)| Medium |
113
+
| <spanid="1188">1188</span> |[Design Bounded Blocking Queue](https://leetcode.com/problems/design-bounded-blocking-queue"设计有限阻塞队列") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/design-bounded-blocking-queue)| Medium |
103
114
| <spanid="1187">1187</span> |[Make Array Strictly Increasing](https://leetcode.com/problems/make-array-strictly-increasing"使数组严格递增")|[Go](https://github.com/openset/leetcode/tree/master/problems/make-array-strictly-increasing)| Hard |
104
115
| <spanid="1186">1186</span> |[Maximum Subarray Sum with One Deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion"删除一次得到子数组最大和")|[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion)| Medium |
105
116
| <spanid="1185">1185</span> |[Day of the Week](https://leetcode.com/problems/day-of-the-week"一周中的第几天")|[Go](https://github.com/openset/leetcode/tree/master/problems/day-of-the-week)| Easy |
@@ -180,7 +191,7 @@ LeetCode Problems' Solutions
180
191
| <spanid="1110">1110</span> |[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest"删点成林")|[Go](https://github.com/openset/leetcode/tree/master/problems/delete-nodes-and-return-forest)| Medium |
181
192
| <spanid="1109">1109</span> |[Corporate Flight Bookings](https://leetcode.com/problems/corporate-flight-bookings"航班预订统计")|[Go](https://github.com/openset/leetcode/tree/master/problems/corporate-flight-bookings)| Medium |
182
193
| <spanid="1108">1108</span> |[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address"IP 地址无效化")|[Go](https://github.com/openset/leetcode/tree/master/problems/defanging-an-ip-address)| Easy |
183
-
| <spanid="1107">1107</span> |[New Users Daily Count](https://leetcode.com/problems/new-users-daily-count) 🔒 |[MySQL](https://github.com/openset/leetcode/tree/master/problems/new-users-daily-count)| Medium |
194
+
| <spanid="1107">1107</span> |[New Users Daily Count](https://leetcode.com/problems/new-users-daily-count"每日新用户统计") 🔒 |[MySQL](https://github.com/openset/leetcode/tree/master/problems/new-users-daily-count)| Medium |
184
195
| <spanid="1106">1106</span> |[Parsing A Boolean Expression](https://leetcode.com/problems/parsing-a-boolean-expression"解析布尔表达式")|[Go](https://github.com/openset/leetcode/tree/master/problems/parsing-a-boolean-expression)| Hard |
185
196
| <spanid="1105">1105</span> |[Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves"填充书架")|[Go](https://github.com/openset/leetcode/tree/master/problems/filling-bookcase-shelves)| Medium |
186
197
| <spanid="1104">1104</span> |[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree"二叉树寻路")|[Go](https://github.com/openset/leetcode/tree/master/problems/path-in-zigzag-labelled-binary-tree)| Medium |
[Next >](https://github.com/openset/leetcode/tree/master/problems/missing-number-in-arithmetic-progression"Missing Number In Arithmetic Progression")
11
+
12
+
## [1227. Airplane Seat Assignment Probability (Medium)](https://leetcode.com/problems/airplane-seat-assignment-probability"")
13
+
14
+
<p><codedata-stringify-type="code">n</code> passengers board an airplane with exactly <codedata-stringify-type="code">n</code> seats. The first passenger has lost the ticket and picks a seat randomly. But after that, the rest of passengers will:</p>
15
+
16
+
<ul>
17
+
<li>Take their own seat if it is still available, </li>
18
+
<li>Pick other seats randomly when they find their seat occupied </li>
19
+
</ul>
20
+
21
+
<p>What is the probability that the n-th person can get his own seat?</p>
22
+
23
+
<p> </p>
24
+
<p><strong>Example 1:</strong></p>
25
+
26
+
<pre>
27
+
<strong>Input:</strong> n = 1
28
+
<strong>Output:</strong> 1.00000
29
+
<strong>Explanation: </strong>The first person can only get the first seat.</pre>
30
+
31
+
<p><strong>Example 2:</strong></p>
32
+
33
+
<pre>
34
+
<strong>Input:</strong> n = 2
35
+
<strong>Output:</strong> 0.50000
36
+
<strong>Explanation: </strong>The second person has a probability of 0.5 to get the second seat (when first person gets the first seat).
Use dynamic programming, dp[i] indicates the probability that the i-th person can get his seat when there're i persons in total. It's okay to start with O(n^2) solution and then optimize it.
[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-sub-folders-from-the-filesystem"Remove Sub-Folders from the Filesystem")
11
+
12
+
## [1232. Check If It Is a Straight Line (Easy)](https://leetcode.com/problems/check-if-it-is-a-straight-line"缀点成线")
13
+
14
+
<p>You are given an array <code>coordinates</code>, <code>coordinates[i] = [x, y]</code>, where <code>[x, y]</code> represents the coordinate of a point. Check if these points make a straight line in the XY plane.</p>
[< Previous](https://github.com/openset/leetcode/tree/master/problems/replace-the-substring-for-balanced-string"Replace the Substring for Balanced String")
## [1235. Maximum Profit in Job Scheduling (Hard)](https://leetcode.com/problems/maximum-profit-in-job-scheduling"规划兼职工作")
13
+
14
+
<p>We have <code>n</code> jobs, where every job is scheduled to be done from <code>startTime[i]</code> to <code>endTime[i]</code>, obtaining a profit of <code>profit[i]</code>.</p>
15
+
16
+
<p>You're given the <code>startTime</code> , <code>endTime</code> and <code>profit</code> arrays, you need to output the maximum profit you can take such that there are no 2 jobs in the subset with overlapping time range.</p>
17
+
18
+
<p>If you choose a job that ends at time <code>X</code> you will be able to start another job that starts at time <code>X</code>.</p>
0 commit comments