C++如何實現(xiàn)字符串刪除字符后逆序輸出

#include <iostream>
#include <cstring>

using namespace std;

void sort_array(char s[][30], int n);

void removing(char s[][30], int n, char ch);

int main() {
  int n, i;
  char s[30][30] = {0};
  char ch;
  cout << "input the number of strings:" << endl;
  cin >> n;
  cin.get();//注意要把/n從輸入流中去除
  for (i = 0; i < n; ++i) {
    cout << "input the NO." << i + 1 << " string:" << endl;
    cin.getline(s[i], 30);
  }
  cout << "input ch:" << endl;
  ch = cin.get();
  removing(s, n, ch);
  sort_array(s, n);
  for (i = 0; i < n; ++i) {
    cout << s[i] << endl;//二維字符串?dāng)?shù)組可以通過這種方式直接輸出
  }
  return 0;
}

void sort_array(char s[][30], int n) {
  int i, j, k, temp;
  for (j = 0; j < n - 1; ++j) {
    bool sort_flag = false;
    //相當(dāng)于一個冒泡排序，這里排序使用了strcmp
    for (i = 0; i < n - j - 1; ++i) {
      char str_temp[30] = {0};
      temp = strcmp(s[i], s[i + 1]);
      if (temp >= 0)continue;
      if (temp < 0) {
        for (k = 0; k < 30; ++k) {
          str_temp[k] = s[i][k];
        }
        for (k = 0; k < 30; ++k) {
          s[i][k] = s[i + 1][k];
        }
        for (k = 0; k < 30; ++k) {
          s[i + 1][k] = str_temp[k];
        }
        sort_flag = true;
      }
    }
    if (!sort_flag) {
      break;
    }
  }
}

void removing(char s[][30], int n, char ch) {
  bool flag = false;
  int i, j, k;
  for (i = 0; i < n; ++i) {
    for (j = 0; s[i][j] != '\0'; ++j) {
      if (s[i][j] == ch) {
        flag = true;
        //去除字符后把后面的往前面移動一位
        for (k = j; s[i][k] != '\0'; ++k) {
          s[i][k] = s[i][k + 1];
        }
      } else { flag = false; }
      if (flag) { j -= 1; }
    }
  }
}