FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2887,3  "name": "sort-vowels-in-a-string",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/sort-vowels-in-a-string/",6  "date": "2023-07-08",7  "task_description": "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**.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "s = \"lEetcOde\"",12      "output": "\"lEOtcede\" "13    },14    {15      "label": "Example 2",16      "input": "s = \"lYmpH\"",17      "output": "\"lYmpH\" "18    }19  ],20  "constraints": [21    "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].",22    "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].",23    "1 <= s.length <= 105",24    "s consists only of letters of the English alphabet in uppercase and lowercase."25  ],26  "python_template": "class Solution(object):\n    def sortVowels(self, s):\n        \"\"\"\n        :type s: str\n        :rtype: str\n        \"\"\"\n        ",27  "java_template": "class Solution {\n    public String sortVowels(String s) {\n        \n    }\n}",28  "metadata": {29    "func_name": "sortVowels"30  }31}