aboutsummaryrefslogtreecommitdiff
path: root/sort_vowel_string.c
blob: 6b5b929e45141548abb8f82ed855dbe17411a04c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
// 2785. Sort Vowels in a String
#include "leetcode.h"

/*
 * given a 0-indexed string 's', permute 's' to get a new string 't'.
  - 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. consonants comprise all letter that are not
 vowels.
  */

bool is_vowel(char c) {
  switch (c) {
  case 'A':
  case 'E':
  case 'I':
  case 'O':
  case 'U':
  case 'a':
  case 'e':
  case 'i':
  case 'o':
  case 'u':
    return true;
  default:
    return false;
  }
}

int cmp(const void *a, const void *b) { return (*(char *)a - *(char *)b); }

char *sortVowels(char *s) {
  int n = strlen(s), cnt = 0;
  char *vowels = (char *)malloc(n * sizeof(char));
  for (int i = 0; i < n; ++i)
    if (is_vowel(s[i]))
      vowels[cnt++] = s[i];
  qsort(vowels, cnt, sizeof(char), cmp);
  for (int i = 0, j = 0; j < n; ++i)
    if (is_vowel(s[i]))
      s[i] = vowels[j++];
  free(vowels);
  return s;
}

int main() {
  char s1[] = {"lEetcOde"}, s2[] = {"lYmpH"};
  printf("%s\n", sortVowels(s1)); // expect: lEOtcede
  printf("%s\n", sortVowels(s2)); // expect: lYmpH
}