给定一组字符，如何仅通过重新排列字符来显示具有更高字典顺序的字符串？

Question

Let's say you have the string cana . The string with the lexicographical order higher than that, would be cnaa . Is there any way you could do that, faster than just checking from right to left for every character?

Answer 1

#include <string>
#include <algorithm>

void swap_chars(char &a, char &b) {
  char m = a;
  a = b;
  b = m;
}

std::string next(std::string str) {
  for (int i=str.length()-1; i>0; i--)
    if (str.at(i-1) < str.at(i)) {
      swap_chars(str.at(i-1), str.at(i));
      std::sort(str.begin()+i, str.end());
      break;
    }
  return str;
}