给定N是一个正整数，求比N大的最小“不重复数”，这里的不重复

string Test38_ADJ(string str){
	//++ to ensure the smallest 自增一，确保比之前的数 大
	int orilen = str.size();
	if( str[str.size()-1] !='9' ){
		str[str.size()-1] += 1;
	}else{
		int pos = str.size()-1;
		str[pos--]='0';
		bool jump = true;
		while(jump && pos>=0){
			if( str[pos] == '9' ){
				str[pos] ='0';jump = true; pos--;
			}else{
				str[pos] +=1;
				jump = false;
			}
		}
		if(jump){
			str = "1"+str;
		}
	}
	//cout<<str;
	

	if( str.size() > orilen ){
		//length increase
		for(int i =1;i< str.size();i++){
			if(i%2==1)str[i]='0';else str[i]='1'; //010101...
		}
	}else{
		//length stay
		if(str.size()>1){ //ensure length > 1
			int fixed = 1;
			while(fixed < str.size()){ //every bit
				if(str[fixed]!=str[fixed-1]){
					fixed++; //@OK,no repeat
				}else{//poorly wrong
					if(str[fixed]=='9'){
						//Circle
						string tmp = Test38_ADJ(str.substr(0,fixed+1));
						//int tchar = tmp[tmp.size()-1]-'0';
						//cout<<"h3:"<<tmp<<endl;
						if(tmp[tmp.size()-1]=='0'){
							for( int i = 0; i< str.size()-fixed-1;i++ ){
								if(i%2==0)tmp+='1';else tmp +='0';
							}
						}else{
							for( int i = 0; i< str.size()-fixed-1;i++ ){
								if(i%2==0)tmp+='0';else tmp +='1';
							}
						}
						str = tmp;
						fixed++;
						//cout<<"he1:"<<str<<endl;
					}else{ //adjust while not wrong
						str[fixed]+=1;
						fixed++;
						//cout<<"he2:"<<str<<endl;
					}
				}
			}
		}
	}
	return str;
}

void Test38(){
	string str;
	cin>>str;
	
	str = Test38_ADJ(str);
	
	cout<<str<<endl;
}

	
	

		#include<iostream>
	

	

		using namespace std;
	

	

		string minX(const string& s){
	

	

		    if(s.size()==1)return string(s);
	

	

		    string result;
	

	

		    result.push_back(s[0]);
	

	

		    bool carry=false;
	

	

		    for(int i=1;i<s.size();++i){
	

	

		        if(carry)result.push_back(result.back()=='0'?'1':'0'); 
	

	

		        else if(s[i]==result.back()){
	

	

		            carry=true;
	

	

		            if(s[i]=='9'){
	

	

		                result.pop_back();
	

	

		                if(result.empty())result.push_back('1');
	

	

		                else result.back()=result.back()+1;
	

	

		                result.push_back('0');
	

	

		                result.push_back('1');
	

	

		            }else result.push_back(s[i]+1);
	

	

		        }else result.push_back(s[i]);
	

	

		    }
	

	

		    return result;
	

	

		}
	

	

		int main(){
	

	

		    string s;
	

	

		    cin>>s;
	

	

		    cout<<minX(s)<<endl;
	

	

		    return 0; 
	

	

		}
	

#include <iostream>
#include <string>
using namespace std;

int main()
{
	int i = 0;
	char c = 0;
	long num = 0;
	cin >> num;
	string strNum = std::to_string(num+1);

	int nHightLength = strNum.length();
	do {
		//查找相邻的重复数
		i = 0;
		do {
			c = strNum[i];
		} while (++i < nHightLength && c != strNum[i]);	//在高位遍历

		//有重复位数,截取高位加1，替换原有的高位
		if (i != nHightLength)
		{
			string substr = strNum.substr(0, i+1);  //截取存在重复的高位
			nHightLength = substr.length();
			long nHignt = stol(substr) + 1;			//加1
			strNum.replace(strNum.begin(), strNum.begin() + i + 1, std::to_string(nHignt));
		}
	} while (i != nHightLength);	//如果循环中有重复，则再次循环，如99+1=100出现了两个0

	//尾部填充0或1，判断填充前高位的最后一个是0还是1
	bool change = strNum[nHightLength - 1] - '0';
	for (int i = nHightLength; i < strNum.length(); ++i, change = !change)
	{
		strNum[i] = change ? '0' : '1';
	}

	cout << strNum << endl;
	system("pause");
	return 0;
}