import java.util.TreeSet;public class N74 {
public static void main(String[] args) {
TreeSet<String> s = new TreeSet<String>();
TreeSet<String>subs = new TreeSet<String>();
s.add("a");
s.add("b");
s.add("d");
s.add("e");
subs = (TreeSet)s.subSet("b",true,"d",true);
s.add("9");
s.add("c2");
TreeSet<String> sub2 = new TreeSet<String>();
sub2 = (TreeSet)s.tailSet("c2",true);
System.out.println(subs + " " + sub2);
}
}
public static void main(String[] args) {
TreeSet<String> s = new TreeSet<String>();
TreeSet<String>subs = new TreeSet<String>();
s.add("a");
s.add("b");
s.add("d");
s.add("e");
subs = (TreeSet)s.subSet("b",true,"d",true);
s.add("9");
s.add("c2");
TreeSet<String> sub2 = new TreeSet<String>();
sub2 = (TreeSet)s.tailSet("c2",true);
System.out.println(subs + " " + sub2);
}
}
import java.util.TreeSet;//引入TreeSet类
//这是个空行
public class N74 {//声明类
public static void main(String[] args) {//main方法
TreeSet<String> s = new TreeSet<String>();//定义并初始化一个String型TreeSet 变量名S
TreeSet<String>subs = new TreeSet<String>();//又定义并初始化了一个TreeSet 变量名subs
s.add("a");//s中添加字符串"a"
s.add("b");//s中添加字符串"b"
s.add("d");//s中添加字符串"d"
s.add("e");//s中添加字符串"e"
//这是另一个空行
//这还是一个空行,目前s中的元素为a,b,d,e
subs = (TreeSet)s.subSet("b",true,"d",true);//取从b开始到d结束的子集合,包括b,也包括d
s.add("9");//s中添加字符串"9"
s.add("c2");//s中添加字符串"c2",目前s中元素为9,a,b,c2,d,e
TreeSet<String> sub2 = new TreeSet<String>();//再声明并初始化一个TreeSet
sub2 = (TreeSet)s.tailSet("c2",true);//取c2开始到结束的子集合,包括c2
System.out.println(subs + " " + sub2);//打印一下
}
}最近我果然很闲
subSet("a","b")方法是返回是返回从a到b之间的元素,包括a,不包括b
tailSet("a")方法返回的是大于等于a的元素;
代码换成这样,楼主看下应该会懂了吧。 TreeSet<String> s = new TreeSet<String>();
TreeSet<String>subs = new TreeSet<String>();
s.add("a");
s.add("b");
s.add("d");
s.add("e");
System.out.println(s);//s现在元素 subs = (TreeSet)s.subSet("b","d");
System.out.println(subs);
s.add("9");
s.add("c2");
System.out.println(s);
System.out.println(subs);
TreeSet<String> sub2 = new TreeSet<String>();
sub2 = (TreeSet)s.tailSet("c2");
System.out.println(subs + " " + sub2);