1
class Solution {
2
 public:
3
  string reformat(string s) {
4
    string dg, al;
5
    for (auto &i : s) isdigit(i) ? dg += i : al += i;
6
    if (abs((int)size(dg) - (int)size(al)) > 1) return "";
7
    int i = 0, j = 0, k = 0;
8
    string ans(size(s), ' ');
9
    bool cdg = size(dg) > size(al);
10
    while (k < size(s)) {
11
      if (cdg)
12
        ans[k++] = dg[i++];
13
      else
14
        ans[k++] = al[j++];
15
      cdg = !cdg;
16
    }
17
    return ans;
18
  }
19
};