首先,创建一个具有字符串值的HashSet-
HashSet<String> hashSet = new HashSet<String>();
hashSet.add("Bradley");
hashSet.add("Katie");
hashSet.add("Brad");
hashSet.add("Amy");
hashSet.add("Ryan");
hashSet.add("Jamie");现在,将HashSet转换为TreeSet-
Set<String> set = new TreeSet<String>(hashSet);
以下是在Java中将HashSet转换为TreeSet的程序-
import java.util.HashSet;
import java.util.Set;
import java.util.TreeSet;
public class Demo {
public static void main(String[] args) {
HashSet<String> hashSet = new HashSet<String>();
hashSet.add("Bradley");
hashSet.add("Katie");
hashSet.add("Brad");
hashSet.add("Amy");
hashSet.add("Ryan");
hashSet.add("Jamie");
hashSet.add("Kevin");
hashSet.add("David");
System.out.println("HashSet = "+ hashSet);
Set<String> set = new TreeSet<String>(hashSet);
System.out.println("TreeSet = "+set);
}
}输出结果
HashSet = [Kevin, Jamie, Ryan, Bradley, Katie, David, Brad, Amy] TreeSet = [Amy, Brad, Bradley, David, Jamie, Katie, Kevin, Ryan]