mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 05:13:29 +08:00
update
This commit is contained in:
@@ -0,0 +1,58 @@
|
||||
<p>You are given an integer <code>n</code>. There are <code>n</code> rooms numbered from <code>0</code> to <code>n - 1</code>.</p>
|
||||
|
||||
<p>You are given a 2D integer array <code>meetings</code> where <code>meetings[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> means that a meeting will be held during the <strong>half-closed</strong> time interval <code>[start<sub>i</sub>, end<sub>i</sub>)</code>. All the values of <code>start<sub>i</sub></code> are <strong>unique</strong>.</p>
|
||||
|
||||
<p>Meetings are allocated to rooms in the following manner:</p>
|
||||
|
||||
<ol>
|
||||
<li>Each meeting will take place in the unused room with the <strong>lowest</strong> number.</li>
|
||||
<li>If there are no available rooms, the meeting will be delayed until a room becomes free. The delayed meeting should have the <strong>same</strong> duration as the original meeting.</li>
|
||||
<li>When a room becomes unused, meetings that have an earlier original <strong>start</strong> time should be given the room.</li>
|
||||
</ol>
|
||||
|
||||
<p>Return<em> the <strong>number</strong> of the room that held the most meetings. </em>If there are multiple rooms, return<em> the room with the <strong>lowest</strong> number.</em></p>
|
||||
|
||||
<p>A <strong>half-closed interval</strong> <code>[a, b)</code> is the interval between <code>a</code> and <code>b</code> <strong>including</strong> <code>a</code> and <strong>not including</strong> <code>b</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 2, meetings = [[0,10],[1,5],[2,7],[3,4]]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong>
|
||||
- At time 0, both rooms are not being used. The first meeting starts in room 0.
|
||||
- At time 1, only room 1 is not being used. The second meeting starts in room 1.
|
||||
- At time 2, both rooms are being used. The third meeting is delayed.
|
||||
- At time 3, both rooms are being used. The fourth meeting is delayed.
|
||||
- At time 5, the meeting in room 1 finishes. The third meeting starts in room 1 for the time period [5,10).
|
||||
- At time 10, the meetings in both rooms finish. The fourth meeting starts in room 0 for the time period [10,11).
|
||||
Both rooms 0 and 1 held 2 meetings, so we return 0.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, meetings = [[1,20],[2,10],[3,5],[4,9],[6,8]]
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong>
|
||||
- At time 1, all three rooms are not being used. The first meeting starts in room 0.
|
||||
- At time 2, rooms 1 and 2 are not being used. The second meeting starts in room 1.
|
||||
- At time 3, only room 2 is not being used. The third meeting starts in room 2.
|
||||
- At time 4, all three rooms are being used. The fourth meeting is delayed.
|
||||
- At time 5, the meeting in room 2 finishes. The fourth meeting starts in room 2 for the time period [5,10).
|
||||
- At time 6, all three rooms are being used. The fifth meeting is delayed.
|
||||
- At time 10, the meetings in rooms 1 and 2 finish. The fifth meeting starts in room 1 for the time period [10,12).
|
||||
Room 0 held 1 meeting while rooms 1 and 2 each held 2 meetings, so we return 1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 100</code></li>
|
||||
<li><code>1 <= meetings.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>meetings[i].length == 2</code></li>
|
||||
<li><code>0 <= start<sub>i</sub> < end<sub>i</sub> <= 5 * 10<sup>5</sup></code></li>
|
||||
<li>All the values of <code>start<sub>i</sub></code> are <strong>unique</strong>.</li>
|
||||
</ul>
|
||||
@@ -0,0 +1,34 @@
|
||||
<p>You are given two <strong>positive</strong> integers <code>startPos</code> and <code>endPos</code>. Initially, you are standing at position <code>startPos</code> on an <strong>infinite</strong> number line. With one step, you can move either one position to the left, or one position to the right.</p>
|
||||
|
||||
<p>Given a positive integer <code>k</code>, return <em>the number of <strong>different</strong> ways to reach the position </em><code>endPos</code><em> starting from </em><code>startPos</code><em>, such that you perform <strong>exactly</strong> </em><code>k</code><em> steps</em>. Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
|
||||
|
||||
<p>Two ways are considered different if the order of the steps made is not exactly the same.</p>
|
||||
|
||||
<p><strong>Note</strong> that the number line includes negative integers.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> startPos = 1, endPos = 2, k = 3
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> We can reach position 2 from 1 in exactly 3 steps in three ways:
|
||||
- 1 -> 2 -> 3 -> 2.
|
||||
- 1 -> 2 -> 1 -> 2.
|
||||
- 1 -> 0 -> 1 -> 2.
|
||||
It can be proven that no other way is possible, so we return 3.</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> startPos = 2, endPos = 5, k = 10
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> It is impossible to reach position 5 from position 2 in exactly 10 steps.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= startPos, endPos, k <= 1000</code></li>
|
||||
</ul>
|
||||
@@ -0,0 +1,37 @@
|
||||
<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
|
||||
|
||||
<p>We call a subarray of <code>nums</code> <strong>nice</strong> if the bitwise <strong>AND</strong> of every pair of elements that are in <strong>different</strong> positions in the subarray is equal to <code>0</code>.</p>
|
||||
|
||||
<p>Return <em>the length of the <strong>longest</strong> nice subarray</em>.</p>
|
||||
|
||||
<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
|
||||
|
||||
<p><strong>Note</strong> that subarrays of length <code>1</code> are always considered nice.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,8,48,10]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> The longest nice subarray is [3,8,48]. This subarray satisfies the conditions:
|
||||
- 3 AND 8 = 0.
|
||||
- 3 AND 48 = 0.
|
||||
- 8 AND 48 = 0.
|
||||
It can be proven that no longer nice subarray can be obtained, so we return 3.</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [3,1,5,11,13]
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> The length of the longest nice subarray is 1. Any subarray of length 1 can be chosen.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@@ -0,0 +1,42 @@
|
||||
<p>You are given a <strong>0-indexed</strong> string <code>s</code> consisting of only lowercase English letters, where each letter in <code>s</code> appears <strong>exactly</strong> <strong>twice</strong>. You are also given a <strong>0-indexed</strong> integer array <code>distance</code> of length <code>26</code>.</p>
|
||||
|
||||
<p>Each letter in the alphabet is numbered from <code>0</code> to <code>25</code> (i.e. <code>'a' -> 0</code>, <code>'b' -> 1</code>, <code>'c' -> 2</code>, ... , <code>'z' -> 25</code>).</p>
|
||||
|
||||
<p>In a <strong>well-spaced</strong> string, the number of letters between the two occurrences of the <code>i<sup>th</sup></code> letter is <code>distance[i]</code>. If the <code>i<sup>th</sup></code> letter does not appear in <code>s</code>, then <code>distance[i]</code> can be <strong>ignored</strong>.</p>
|
||||
|
||||
<p>Return <code>true</code><em> if </em><code>s</code><em> is a <strong>well-spaced</strong> string, otherwise return </em><code>false</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "abaccb", distance = [1,3,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong>
|
||||
- 'a' appears at indices 0 and 2 so it satisfies distance[0] = 1.
|
||||
- 'b' appears at indices 1 and 5 so it satisfies distance[1] = 3.
|
||||
- 'c' appears at indices 3 and 4 so it satisfies distance[2] = 0.
|
||||
Note that distance[3] = 5, but since 'd' does not appear in s, it can be ignored.
|
||||
Return true because s is a well-spaced string.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "aa", distance = [1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
|
||||
<strong>Output:</strong> false
|
||||
<strong>Explanation:</strong>
|
||||
- 'a' appears at indices 0 and 1 so there are zero letters between them.
|
||||
Because distance[0] = 1, s is not a well-spaced string.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= s.length <= 52</code></li>
|
||||
<li><code>s</code> consists only of lowercase English letters.</li>
|
||||
<li>Each letter appears in <code>s</code> exactly twice.</li>
|
||||
<li><code>distance.length == 26</code></li>
|
||||
<li><code>0 <= distance[i] <= 50</code></li>
|
||||
</ul>
|
||||
Reference in New Issue
Block a user