remove-adjacent-almost-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

You are given a 0-indexed string <code>word</code>.

In one operation, you can pick any index <code>i</code> of <code>word</code> and change <code>word[i]</code> to any lowercase English letter.

Return the minimum number of operations needed to remove all adjacent almost-equal characters from <code>word</code>.

Two characters <code>a</code> and <code>b</code> are almost-equal if <code>a == b</code> or <code>a</code> and <code>b</code> are adjacent in the alphabet.

&nbsp;
Example 1:

<pre>
Input: word = &quot;aaaaa&quot;
Output: 2
Explanation: We can change word into &quot;acaca&quot; which does not have any adjacent almost-equal characters.
It can be shown that the minimum number of operations needed to remove all adjacent almost-equal characters from word is 2.
</pre>

Example 2:

<pre>
Input: word = &quot;abddez&quot;
Output: 2
Explanation: We can change word into &quot;ybdoez&quot; which does not have any adjacent almost-equal characters.
It can be shown that the minimum number of operations needed to remove all adjacent almost-equal characters from word is 2.</pre>

Example 3:

<pre>
Input: word = &quot;zyxyxyz&quot;
Output: 3
Explanation: We can change word into &quot;zaxaxaz&quot; which does not have any adjacent almost-equal characters. 
It can be shown that the minimum number of operations needed to remove all adjacent almost-equal characters from word is 3.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word.length &lt;= 100</code></li>
	<li><code>word</code> consists only of lowercase English letters.</li>
</ul>

removeAlmostEqualCharacters

Remove Adjacent Almost-Equal Characters

Minimum Changes To Make Alternating Binary String

minimum-changes-to-make-alternating-binary-string

生成交替二进制字符串的最少操作数

Greedy

String

Dynamic Programming

给你一个下标从 0&nbsp;开始的字符串&nbsp;<code>word</code>&nbsp;。

一次操作中，你可以选择&nbsp;<code>word</code>&nbsp;中任意一个下标 <code>i</code>&nbsp;，将&nbsp;<code>word[i]</code> 修改成任意一个小写英文字母。

请你返回消除 <code>word</code>&nbsp;中所有相邻 近似相等&nbsp;字符的 最少&nbsp;操作次数。

两个字符&nbsp;<code>a</code> 和&nbsp;<code>b</code>&nbsp;如果满足&nbsp;<code>a == b</code>&nbsp;或者&nbsp;<code>a</code> 和&nbsp;<code>b</code>&nbsp;在字母表中是相邻的，那么我们称它们是 近似相等&nbsp;字符。

&nbsp;

示例 1：

<pre>
输入：word = "aaaaa"
输出：2
解释：我们将 word 变为 "acaca" ，该字符串没有相邻近似相等字符。
消除 word 中所有相邻近似相等字符最少需要 2 次操作。
</pre>

示例 2：

<pre>
输入：word = "abddez"
输出：2
解释：我们将 word 变为 "ybdoez" ，该字符串没有相邻近似相等字符。
消除 word 中所有相邻近似相等字符最少需要 2 次操作。</pre>

示例 3：

<pre>
输入：word = "zyxyxyz"
输出：3
解释：我们将 word 变为 "zaxaxaz" ，该字符串没有相邻近似相等字符。
消除 word 中所有相邻近似相等字符最少需要 3 次操作
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= word.length &lt;= 100</code></li>
	<li><code>word</code>&nbsp;只包含小写英文字母。</li>
</ul>