Today I have done leetcode's November LeetCoding Challenge with cpp.

November LeetCoding Challenge 13

Description

Sort Vowels in a String

Given a 0-indexed string s, permute s to get a new string t such that:

• All consonants remain in their original places. More formally, if there is an index i with 0 <= i < s.length such that s[i] is a consonant, then t[i] = s[i].
• The vowels must be sorted in the nondecreasing order of their ASCII values. More formally, for pairs of indices i, j with 0 <= i < j < s.length such that s[i] and s[j] are vowels, then t[i] must not have a higher ASCII value than t[j].

Return the resulting string.

The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in lowercase or uppercase. Consonants comprise all letters that are not vowels.

Example 1:

Input: s = "lEetcOde"
Output: "lEOtcede"
Explanation: 'E', 'O', and 'e' are the vowels in s; 'l', 't', 'c', and 'd' are all consonants. The vowels are sorted according to their ASCII values, and the consonants remain in the same places.

Example 2:

Input: s = "lYmpH"
Output: "lYmpH"
Explanation: There are no vowels in s (all characters in s are consonants), so we return "lYmpH".

Constraints:

• 1 <= s.length <= 105
• s consists only of letters of the English alphabet in uppercase and lowercase.

Solution

class Solution {
public:
  string sortVowels(string s) {
    set<char> vowel({'a', 'e', 'i','o', 'u', 'A', 'E', 'I', 'O', 'U'});
    vector<char> vowels;
    for(auto c : s) {
      if(vowel.count(c)) {
        vowels.push_back(c);
      }
    }
    sort(vowels.begin(), vowels.end());
    int pos = 0;
    for(auto &c : s) {
      if(vowel.count(c)) {
        c = vowels[pos++];
      }
    }

    return s;
  }
};

// Accepted
// 2216/2216 cases passed (65 ms)
// Your runtime beats 16.8 % of cpp submissions
// Your memory usage beats 32.2 % of cpp submissions (14 MB)