feat: solve No.2785

Author: BaffinLee

2701-2800/2785. Sort Vowels in a String.md

@@ -0,0 +1,86 @@
+# 2785. Sort Vowels in a String
+
+- Difficulty: Medium.
+- Related Topics: String, Sorting.
+- Similar Questions: Reverse Vowels of a String.
+
+## Problem
+
+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
+
+```javascript
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var sortVowels = function(s) {
+    var vowels = s.split('')
+        .filter(isVowels)
+        .sort((a, b) => a.charCodeAt(0) - b.charCodeAt(0));
+    var res = '';
+    var index = 0;
+    for (var i = 0; i < s.length; i++) {
+        if (isVowels(s[i])) {
+            res += vowels[index++];
+        } else {
+            res += s[i];
+        }
+    }
+    return res;
+};
+
+var isVowels = function(char) {
+    var chars = ['a', 'e', 'i', 'o', 'u'];
+    return chars.includes(char.toLowerCase()) || chars.includes(char.toUpperCase());
+};
+```
+
+**Explain:**
+
+nope.
+
+**Complexity:**
+
+* Time complexity : O(n * log(n)).
+* Space complexity : O(n).