mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
42 lines
2.8 KiB
HTML
42 lines
2.8 KiB
HTML
|
<p>There is a long table with a line of plates and candles arranged on top of it. You are given a <strong>0-indexed</strong> string <code>s</code> consisting of characters <code>'*'</code> and <code>'|'</code> only, where a <code>'*'</code> represents a <strong>plate</strong> and a <code>'|'</code> represents a <strong>candle</strong>.</p>
|
||
|
|
|
||
|
|
<p>You are also given a <strong>0-indexed</strong> 2D integer array <code>queries</code> where <code>queries[i] = [left<sub>i</sub>, right<sub>i</sub>]</code> denotes the <strong>substring</strong> <code>s[left<sub>i</sub>...right<sub>i</sub>]</code> (<strong>inclusive</strong>). For each query, you need to find the <strong>number</strong> of plates <strong>between candles</strong> that are <strong>in the substring</strong>. A plate is considered <strong>between candles</strong> if there is at least one candle to its left <strong>and</strong> at least one candle to its right <strong>in the substring</strong>.</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>For example, <code>s = "||**||**|*"</code>, and a query <code>[3, 8]</code> denotes the substring <code>"*||<strong><u>**</u></strong>|"</code>. The number of plates between candles in this substring is <code>2</code>, as each of the two plates has at least one candle <strong>in the substring</strong> to its left <strong>and</strong> right.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>Return <em>an integer array</em> <code>answer</code> <em>where</em> <code>answer[i]</code> <em>is the answer to the</em> <code>i<sup>th</sup></code> <em>query</em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="ex-1" src="https://assets.leetcode.com/uploads/2021/10/04/ex-1.png" style="width: 400px; height: 134px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "**|**|***|", queries = [[2,5],[5,9]]
|
||
|
|
<strong>Output:</strong> [2,3]
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
- queries[0] has two plates between candles.
|
||
|
|
- queries[1] has three plates between candles.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="ex-2" src="https://assets.leetcode.com/uploads/2021/10/04/ex-2.png" style="width: 600px; height: 193px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "***|**|*****|**||**|*", queries = [[1,17],[4,5],[14,17],[5,11],[15,16]]
|
||
|
|
<strong>Output:</strong> [9,0,0,0,0]
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
- queries[0] has nine plates between candles.
|
||
|
|
- The other queries have zero plates between candles.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>3 <= s.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>s</code> consists of <code>'*'</code> and <code>'|'</code> characters.</li>
|
||
|
|
<li><code>1 <= queries.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>queries[i].length == 2</code></li>
|
||
|
|
<li><code>0 <= left<sub>i</sub> <= right<sub>i</sub> < s.length</code></li>
|
||
|
|
</ul>
|