1957. Delete Characters to Make Fancy String

A fancy string is a string where no three consecutive characters are equal.

Given a string s, delete the minimum possible number of characters from s to make it fancy.

Return the final string after the deletion. It can be shown that the answer will always be unique.

 

Example 1:

Input: s = "leeetcode"
Output: "leetcode"
Explanation:
Remove an 'e' from the first group of 'e's to create "leetcode".
No three consecutive characters are equal, so return "leetcode".

Example 2:

Input: s = "aaabaaaa"
Output: "aabaa"
Explanation:
Remove an 'a' from the first group of 'a's to create "aabaaaa".
Remove two 'a's from the second group of 'a's to create "aabaa".
No three consecutive characters are equal, so return "aabaa".

Example 3:

Input: s = "aab"
Output: "aab"
Explanation: No three consecutive characters are equal, so return "aab".

 

Constraints:

  • 1 <= s.length <= 105
  • s consists only of lowercase English letters.

1957. Delete Characters to Make Fancy String
struct Solution;

impl Solution {
    fn make_fancy_string(s: String) -> String {
        let mut count = 0;
        let mut prev = ' ';
        let mut res = "".to_string();
        for c in s.chars() {
            if c == prev {
                if count < 2 {
                    res.push(c);
                }
                count += 1;
            } else {
                res.push(c);
                prev = c;
                count = 1;
            }
        }
        res
    }
}

#[test]
fn test() {
    let s = "leeetcode".to_string();
    let res = "leetcode".to_string();
    assert_eq!(Solution::make_fancy_string(s), res);
    let s = "aaabaaaa".to_string();
    let res = "aabaa".to_string();
    assert_eq!(Solution::make_fancy_string(s), res);
    let s = "aab".to_string();
    let res = "aab".to_string();
    assert_eq!(Solution::make_fancy_string(s), res);
}