字典序排序

输出所有的字典序排序

include

using namespace std;

int main()
{
int n;
cin >> n;
int a[100];
for (int i = 1; i <= n; i++)
{
a[i] = i;
cout << a[i]; //输出第一个排序
}
cout << endl;
while (1)
{
int flag = 0;
for (int i = 1; i <= n; i++) //判断是否输出完成
{
if (a[i] != n - i + 1)
{
flag = 0;
break;
}
if (i == n)
{
flag = 1;
}
}
if (flag == 0)
{
if (a[n] > a[n - 1]) //如果最后一位大于倒数第二位，交换位置
{
int temp = a[n];
a[n] = a[n - 1];
a[n - 1] = temp;
}
else
{
int i = n;
while (1) //找出最大的降序队列
{
if (a[i - 1] < a[i])
{
i–;
break;
}
i–;
}
int min = i + 1;
int j = min;
while (1) //找出队列中最小的大于i的数
{
if (j == n)
{
break;
}
if (a[j] > a[j + 1]&&a[j+1]>a[i])
{
min = j + 1;
}
j++;
}
int temp = a[i]; //交换啊ai和aj
a[i] = a[min];
a[min] = temp;
int start = i + 1;
int end = n;
while (1) 将i后面的数组反序
{
int temp = a[start];
a[start] = a[end];
a[end] = temp;
if (start == end||start==end-1)
{
break;
}

                start++;
                end--;
            }
        }
        for (int i = 1; i <= n; i++)
        {
            cout << a[i];
        }
        cout << endl;
    }
    else
    {
        break;
    }
}
return 0;

}