五月天青色头像情侣网名,国产亚洲av片在线观看18女人,黑人巨茎大战俄罗斯美女,扒下她的小内裤打屁股

歡迎光臨散文網(wǎng) 會(huì)員登陸 & 注冊(cè)

LeetCode 2716. Minimize String Length

2023-06-04 12:14 作者:您是打尖兒還是住店呢  | 我要投稿

Given a?0-indexed?string?s, repeatedly perform the following operation?any?number of times:

  • Choose an index?i?in the string, and let?c?be the character in position?i.?Delete?the?closest occurrence?of?c?to the?left?of?i?(if any) and the?closest occurrence?of?c?to the?right?of?i?(if any).

Your task is to?minimize?the length of?s?by performing the above operation any number of times.

Return?an integer denoting the length of the?minimized?string.

?

Example 1:

Input: s = "aaabc"Output: 3

Explanation: In this example, s is "aaabc". We can start by selecting the character 'a' at index 1. We then remove the closest 'a' to the left of index 1, which is at index 0, and the closest 'a' to the right of index 1, which is at index 2. After this operation, the string becomes "abc". Any further operation we perform on the string will leave it unchanged. Therefore, the length of the minimized string is 3.

Example 2:

Input: s = "cbbd"Output: 3

Explanation:?

For this we can start with character 'b' at index 1. There is no occurrence of 'b' to the left of index 1, but there is one to the right at index 2, so we delete the 'b' at index 2. The string becomes "cbd" and further operations will leave it unchanged. Hence, the minimized length is 3.?

Example 3:

Input: s = "dddaaa"Output: 2

Explanation: For this, we can start with the character 'd' at index 1. The closest occurrence of a 'd' to its left is at index 0, and the closest occurrence of a 'd' to its right is at index 2. We delete both index 0 and 2, so the string becomes "daaa". In the new string, we can select the character 'a' at index 2. The closest occurrence of an 'a' to its left is at index 1, and the closest occurrence of an 'a' to its right is at index 3. We delete both of them, and the string becomes "da". We cannot minimize this further, so the minimized length is 2.

?

用hashset更快;

?

Constraints:

  • 1 <= s.length <= 100

  • s?contains only lowercase English letters


Runtime:?5 ms, faster than?100.00%?of?Java?online submissions for?Minimize String Length.

Memory Usage:?43.8 MB, less than?25.00%?of?Java?online submissions for?Minimize String Length.


LeetCode 2716. Minimize String Length的評(píng)論 (共 條)

分享到微博請(qǐng)遵守國(guó)家法律
泰兴市| 宕昌县| 道孚县| 于田县| 绿春县| 永德县| 三明市| 焉耆| 商都县| 镇康县| 赞皇县| 沙湾县| 隆昌县| 如皋市| 绿春县| 西盟| 龙门县| 金寨县| 札达县| 广昌县| 阜新| 婺源县| 习水县| 河北区| 绥滨县| 林甸县| 长兴县| 兰溪市| 福安市| 遂平县| 昭平县| 西安市| 汶川县| 溧阳市| 武山县| 武平县| 汕头市| 洮南市| 贵德县| 临漳县| 翁源县|