package com.ag;
public class Test {
/**
* For a given string that only contains alphabet characters a-z, if 3 or more consecutive
* characters are identical, remove them from the string. Repeat this process until
* there is no more than 3 identical characters sitting besides each other.
* Example:
* Input: aabcccbbad
* Output:
* -> aabbbad
* -> aaad
* -> d
*/
public String removeConsecutive(String s) {
StringBuilder result = new StringBuilder();
if (s.length() >= 1) {
for (int i = 0; i < s.length(); i++) {
char currentChar = s.charAt(i);
int count = 0;
for (int j = 0; j < s.length(); j++) {
if (s.charAt(j) == currentChar) {
count++;
}
}
if (count <= 2) {
result = result.append(currentChar);
}
}
}
return result.toString();
}
/**
*#Stage 2 - advanced requirement
* Instead of removing the consecutively identical characters, replace them with a
* single character that comes before it alphabetically.
* Example:
* ccc -> b
* bbb -> a
* Input: abcccbad
* Output:
* -> abbbad, ccc is replaced by b
* -> aaad, bbb is replaced by a
* -> d
*/
public String replaceConsecutive(String s) {
while (true) {
StringBuilder newString = new StringBuilder();
int count = 1;
for (int i = 1; i < s.length(); i++) {
if (i > 0 && s.charAt(i) == s.charAt(i - 1)) {
count++;
} else {
if (count >= 3) {
// 替换为前一个字母
if ((s.charAt(i - 1) - 1) == 96) {
newString.append("");
} else {
char newChar = (char) (s.charAt(i - 1) - 1);
newString.append(newChar);
}
} else {
for (int j = 0; j < count; j++) {
newString.append(s.charAt(j));
}
}
count = 1;
}
}
// 处理最后一组字符
if (count >= 3) {
char newChar = (char) (s.charAt(s.length() - 1) - 1);
newString.append(newChar);
} else {
for (int j = 0; j < count; j++) {
newString.append(s.charAt(s.length() - 1));
}
}
String newStr = newString.toString();
if (newStr.equals(s)) { // 没有变化
break;
}
s = newStr;
}
return s;
}
public static void main(String[] args) {
Test t = new Test();
String s1 = "aabcccbbad";
String s2 = "abcccbad";
System.out.println(t.removeConsecutive(s1)); // d
System.out.println(t.replaceConsecutive(s2)); // d
}
}
超过三个连续重复的字母删除
mask哥2024-09-17 0:36
相关推荐
深漂的华哥4 分钟前
Ruoyi-Plus前后端分离场景下,数据加密传输sel_931 分钟前
【强化学习】Hands-on Modern RL项目实践|OPD 算法完整解析Navigator_Z1 小时前
LeetCode //C - 1209. Remove All Adjacent Duplicates in String II落魄大学生之流水线上谋生计1 小时前
Java锁全面指南:从基础概念到企业级应用why技术1 小时前
eli5,我觉得这个全网在吹的技能,使用体验真的很一般啊。excel1 小时前
记录升级 nuxt3 到 nuxt4 记录剑胆琴心静水深流2 小时前
全栈之路6---web集成与呈现前端snow2 小时前
ai agent -- Memory汇总爱学习的小白柏2 小时前
【AI问数技术】多Agent协同架构:查询规划/SQL生成/洞察分析/报告生成