mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
77 lines
3.2 KiB
HTML
77 lines
3.2 KiB
HTML
<p>You are given an array of strings <code>words</code>. For each index <code>i</code> in the range <code>[0, words.length - 1]</code>, perform the following steps:</p>
|
|
|
|
<ul>
|
|
<li>Remove the element at index <code>i</code> from the <code>words</code> array.</li>
|
|
<li>Compute the <strong>length</strong> of the <strong>longest common <span data-keyword="string-prefix">prefix</span></strong> among all <strong>adjacent</strong> pairs in the modified array.</li>
|
|
</ul>
|
|
|
|
<p>Return an array <code>answer</code>, where <code>answer[i]</code> is the length of the longest common prefix between the adjacent pairs after removing the element at index <code>i</code>. If <strong>no</strong> adjacent pairs remain or if <strong>none</strong> share a common prefix, then <code>answer[i]</code> should be 0.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">words = ["jump","run","run","jump","run"]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">[3,0,0,3,3]</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<ul>
|
|
<li>Removing index 0:
|
|
<ul>
|
|
<li><code>words</code> becomes <code>["run", "run", "jump", "run"]</code></li>
|
|
<li>Longest adjacent pair is <code>["run", "run"]</code> having a common prefix <code>"run"</code> (length 3)</li>
|
|
</ul>
|
|
</li>
|
|
<li>Removing index 1:
|
|
<ul>
|
|
<li><code>words</code> becomes <code>["jump", "run", "jump", "run"]</code></li>
|
|
<li>No adjacent pairs share a common prefix (length 0)</li>
|
|
</ul>
|
|
</li>
|
|
<li>Removing index 2:
|
|
<ul>
|
|
<li><code>words</code> becomes <code>["jump", "run", "jump", "run"]</code></li>
|
|
<li>No adjacent pairs share a common prefix (length 0)</li>
|
|
</ul>
|
|
</li>
|
|
<li>Removing index 3:
|
|
<ul>
|
|
<li><code>words</code> becomes <code>["jump", "run", "run", "run"]</code></li>
|
|
<li>Longest adjacent pair is <code>["run", "run"]</code> having a common prefix <code>"run"</code> (length 3)</li>
|
|
</ul>
|
|
</li>
|
|
<li>Removing index 4:
|
|
<ul>
|
|
<li>words becomes <code>["jump", "run", "run", "jump"]</code></li>
|
|
<li>Longest adjacent pair is <code>["run", "run"]</code> having a common prefix <code>"run"</code> (length 3)</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">words = ["dog","racer","car"]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">[0,0,0]</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<ul>
|
|
<li>Removing any index results in an answer of 0.</li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= words.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= words[i].length <= 10<sup>4</sup></code></li>
|
|
<li><code>words[i]</code> consists of lowercase English letters.</li>
|
|
<li>The sum of <code>words[i].length</code> is smaller than or equal <code>10<sup>5</sup></code>.</li>
|
|
</ul>
|