1.给出任意一个正整数,算出大于它的最小不重复数(即不存在相邻两个数位相同的情况)
public class MinNumber2 {
public int getMinNumber (int base) {
int result = 0;
StringBuilder sb = new StringBuilder(new Integer(base + 1).toString());
List<Character> list = new ArrayList<Character>();
//将各个数字装到容器中
for (int i = 0; i < sb.length(); i++) {
list.add(sb.charAt(i));
}
//判断
for (int i = 0; i < list.size() - 1; i++) {
//如果找到两个相同的数位
if (list.get(i) == list.get(i+1)) {
int temp = 0;
//修改后面的字符
for (int j = i + 2; j < sb.length(); j++) {
temp = j - i - 2;
if (temp % 2 == 0) {
list.set(j, '0');
} else {
list.set(j, '1');
}
}
//修改相同的两个数位的数字
if (list.get(i) == '9') {
list.set(i, '0');
list.set(i+1, '1');
list.add(i, '1');
} else {
list.set(i+1, (char)(list.get(i+1)+1));
}
}
}
//返回结果
for (int i = 0; i < list.size(); i++) {
result = result * 10;
result = result + (int)(list.get(i)-'0');
}
return result;
}
}
public class MinNumber2 {
public int getMinNumber (int base) {
int result = 0;
StringBuilder sb = new StringBuilder(new Integer(base + 1).toString());
List<Character> list = new ArrayList<Character>();
//将各个数字装到容器中
for (int i = 0; i < sb.length(); i++) {
list.add(sb.charAt(i));
}
//判断
for (int i = 0; i < list.size() - 1; i++) {
//如果找到两个相同的数位
if (list.get(i) == list.get(i+1)) {
int temp = 0;
//修改后面的字符
for (int j = i + 2; j < sb.length(); j++) {
temp = j - i - 2;
if (temp % 2 == 0) {
list.set(j, '0');
} else {
list.set(j, '1');
}
}
//修改相同的两个数位的数字
if (list.get(i) == '9') {
list.set(i, '0');
list.set(i+1, '1');
list.add(i, '1');
} else {
list.set(i+1, (char)(list.get(i+1)+1));
}
}
}
//返回结果
for (int i = 0; i < list.size(); i++) {
result = result * 10;
result = result + (int)(list.get(i)-'0');
}
return result;
}
}