The Next Permutation C++

题目描述

For this problem, you will write a program that takes a (possibly long) string of decimal digits, and outputs the permutation of those decimal digits that has the next larger value (as a decimal number) than the input number. For example: 123 -> 132 279134399742 - 279134423799 It is possible that no permutation of the input digits has a larger value. For example, 987.

输入格式:

The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set is a single line that contains the data set number, followed by a space, followed by up to 80 decimal digits which is the input value.

输出格式:

For each data set there is one line of output. If there is no larger permutation of the input digits, the output should be the data set number followed by a single space, followed by the string BIGGEST. If there is a solution, the output should be the data set number, a single space and the next larger permutation of the input digits.

输入样例

3
1 123
2 279134399742
3 987

输出样例

1 132
2 279134423799
3 BIGGEST

这道题的意思就是说给你一个字符串数字x，能否将数字位置交换得到一个最小且大于x的字符串数字y，然后输出序号+得到的字符串数字y
这道题的解法其实可以先思考一下，要想得到一个最小的字符串数字，则要找一个数从左往右最靠右侧较小的数字和从右侧开始数大于该数的数字进行交换，279134399742像这个例子，从左往右可以发现3和从右往左的4进行交换，交换后得到279134499732，此时必然是大于原先的字符串数字，但是要想得到最小的字符串数字，则要将279134499732中4的右侧数的小数放在前面，利用递归进行循环可以进行交换，我比较喜欢c++里的string做这道题。
然后这个题理解一下其实不难，当然感觉学校的oj测试用例有些弱，不知道遇到大数的时候这个递归会不会死掉，当然题目说最多只有80个字符数字，那其实问题不大，AC了就行。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<stdio.h>
#include<cmath>
using namespace std;
string line;
void dfs(int left){
	if(left>=line.size()){
		return;
	}
	char a;
	for(int i=left;i<line.size();i++){	
		for(int j=line.size()-1;j>left;j--){
			if(line[i]>line[j]){
				a = line[i];
				line[i] = line[j];
				line[j] = a;
			}
		}
	}
	left++;
	dfs(left);
}
main()
{
	int n,list;
	cin>>n;
	while(n--){
		cin>>list>>line;
		int leftN=-1,rightN=line.size();
		for(int i=0;i<rightN;i++){//从左往右
			for(int j=line.size()-1;j>i;j--){	//从右往左，到i过就行，要找的范围段一直在leftN后
				if(line[j]>line[i]&&i>leftN){
					leftN=i;	//找到最小的进行交换
					rightN=j;
				}
			}
		}
		if(leftN==-1){
			cout<<list<<" BIGGEST"<<endl;	//如果leftN没有改变那就说明没有交换的数字
		}else{
			char a;
			a = line[leftN];	
			line[leftN] = line[rightN];
			line[rightN] = a;	//交换
			dfs(leftN+1);	//递归
			cout<<list<<" "<<line<<endl;
		}
	}
}

我的代码可能有点难理解，上面的解释有点乱，挺菜的也不知道怎么讲，就将就看，有什么问题请大家指出。互啄一下。