largest-substring-between-two-equal-characters

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code>, return the length of the longest substring between two equal characters, excluding the two characters. If there is no such substring return <code>-1</code>.

A substring is a contiguous sequence of characters within a string.

&nbsp;
Example 1:

<pre>
Input: s = &quot;aa&quot;
Output: 0
Explanation: The optimal substring here is an empty substring between the two <code>&#39;a&#39;s</code>.</pre>

Example 2:

<pre>
Input: s = &quot;abca&quot;
Output: 2
Explanation: The optimal substring here is &quot;bc&quot;.
</pre>

Example 3:

<pre>
Input: s = &quot;cbzxy&quot;
Output: -1
Explanation: There are no characters that appear twice in s.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 300</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
</ul>

maxLengthBetweenEqualCharacters

Largest Substring Between Two Equal Characters

Hash Table

String

给你一个字符串 <code>s</code>，请你返回 两个相同字符之间的最长子字符串的长度 ，计算长度时不含这两个字符。如果不存在这样的子字符串，返回 <code>-1</code> 。

子字符串 是字符串中的一个连续字符序列。

 

示例 1：

<pre>输入：s = "aa"
输出：0
解释：最优的子字符串是两个 'a' 之间的空子字符串。</pre>

示例 2：

<pre>输入：s = "abca"
输出：2
解释：最优的子字符串是 "bc" 。
</pre>

示例 3：

<pre>输入：s = "cbzxy"
输出：-1
解释：s 中不存在出现出现两次的字符，所以返回 -1 。
</pre>

示例 4：

<pre>输入：s = "cabbac"
输出：4
解释：最优的子字符串是 "abba" ，其他的非最优解包括 "bb" 和 "" 。
</pre>

 

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 300</code></li>
	<li><code>s</code> 只含小写英文字母</li>
</ul>

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!