next permutation的实现

观察全排列的第一个 12345 和 最后一个 54321 可以发现

全排列的第一个是升序的，最后一个是降序的，

今天我们就用这一点解决如何某一排列的下一个。

========== ======== ======= ====== ===== ==== ==== === == =

stop ! stop it Ray ! Even if you are facing a bitter  aspect of life , drugs and murder are foul without any excuse ,

deserve a red card  for a loser .                         ——  Conan

Trie , I was a cheater , a bad player and I lost the game . I must be adjudicative ,

for both my late wife and a fun like you .            —— Ray

next permutation的实现

原文：https://www.cnblogs.com/asdfknjhu/p/12989203.html