输入一串数字字符串，输出没有重复数字，而且是最大的值

主要思想是去重、排序

public String handle(String input){
    TreeSet<Integer> treeSet = new TreeSet<Integer>();
    for (int i=0;i<input.length();i++){
         treeSet.add(Integer.valueOf(""+input.charAt(i)));
    }
    StringBuffer stringBuffer = new StringBuffer();
    Integer[] integers = new Integer[treeSet.size()];
    treeSet.toArray(integers);
    for(int i=integers.length-1;i>=0;i--){
        stringBuffer.append(integers[i].intValue());
    }
    return stringBuffer.toString();
}

本地动手操作的代码

import java.util.*;

public class Demo{
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        while (true){
            String input = "";
            System.out.println("请输入：");
            if(!(input = scanner.nextLine()).isEmpty()){
                System.out.println("输入为："+input);
                TreeSet<Integer> treeSet = new TreeSet<Integer>();
                for (int i=0;i<input.length();i++){
                    treeSet.add(Integer.valueOf(""+input.charAt(i)));
                }
                StringBuffer stringBuffer = new StringBuffer();
                Integer[] integers = new Integer[treeSet.size()];
                treeSet.toArray(integers);
                for(int i=integers.length-1;i>=0;i--){
                    stringBuffer.append(integers[i].intValue());
                }
                System.out.println("结果为："+stringBuffer.toString());
            }
        }
    }
}

---