给定任意一个正整数,求比这个数大且最小的不重复数,“不重复数”的含义是相邻两位不同(java写的)

package Test;


import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class MinNum {
static List<String> list = new ArrayList<String>();
static List<String> old1 = new ArrayList<String>();
static List<String> old2 = new ArrayList<String>();


public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入任意一个整数");
int a = sc.nextInt();
String s1 = String.valueOf(a);
for (int i = 0; i < s1.length(); i++) {
list.add(String.valueOf(a % 10));
old1.add(String.valueOf(a % 10));
old2.add(String.valueOf(a % 10));
a = a / 10;
}
List<String> upper = UpperFirstTwo(list);
if (old1.size() == list.size() || old1.equals(old2)) {
for (int i = old1.size() - 1; i > upper.size() - 1; i--) {
System.out.print(old1.get(i));
}
for (int i = upper.size() - 1; i >= 0; i--) {
System.out.print(upper.get(i));
}
} else {
for (int i = old1.size() - 1; i >= 0; i--) {
System.out.print(old1.get(i));
}
}
}


public static List<String> UpperFirstTwo(List<String> list) {
int size = list.size();
if (list.get(size - 1).equals(list.get(size - 2))
&& !list.get(size - 1).equals("9")) {
int add = Integer.parseInt(list.get(size - 2)) + 1;
String a = String.valueOf(add);
list.set(size - 2, a);
LeftNum(list);
} else if (list.get(size - 1).equals("9") && list.get(size - 2).equals("9")) {
if (old1.size() == size) {
old1.set(size - 1, "0");
old1.set(size - 2, "0");
old1.add(size, "1");
LeftNum1(old1);
} else {
int add = Integer.parseInt(old1.get(size)) + 1;
String a = String.valueOf(add);
old1.set(size, a);
LeftNum2(old1,size);
}
} else {
list.remove(size - 1);
if (list.size() >= 2) {
UpperFirstTwo(list);
} else {
LastTwoNum(old1);
}
}
return list;
}


public static void LeftNum(List<String> list) {
for (int i = list.size() - 3; i >= 0; i = i - 2) {
list.set(i, "0");
}
for (int i = list.size() - 4; i >= 0; i = i - 2) {
list.set(i, "1");
}
}


public static void LeftNum1(List<String> list) {
for (int i = list.size() - 3; i >= 0; i = i - 2) {
list.set(i, "1");
}
for (int i = list.size() - 4; i >= 0; i = i - 2) {
list.set(i, "0");
}
}

public static void LeftNum2(List<String> list,int size) {
for (int i = size - 1; i >= 0; i = i - 2) {
list.set(i, "0");
}
for (int i = size - 2; i >= 0; i = i - 2) {
list.set(i, "1");
}
}


public static void LastTwoNum(List<String> old) {
int add1 = Integer.parseInt(old.get(0)) + 1;
String a1 = String.valueOf(add1);
old.set(0, a1);
if (old.get(0).equals("10")) {
old.set(0, "0");
int add2 = Integer.parseInt(old.get(1)) + 1;
String a2 = String.valueOf(add2);
old.set(1, a2);
}
if (old.get(0).equals(old.get(1))) {
LastTwoNum(old);
}
}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值