给出下列【代码】注释标注的代码的输出结果。import java.util.*;public class E {public static void main(String args[]) {Stack stack=new Stack();stack.push(1);stack.push(2);int m = stack.pop();System.out.printf("%d,%d",stack.size(),m);//【代码】}}
查看答案
给出下列【代码】注释标注的代码的输出结果。import java.util.*;public class E {public static void main(String args[]) {Stack stack=new Stack();stack.push(1);stack.push(100);int m = stack.peek();System.out.printf("%d,%d",stack.size(),m);//【代码】}}
给出下列【代码】注释标注的代码的输出结果。import java.util.*;public class E {public static void main(String args[]) {HashMap hashMap = new HashMap() ;hashMap.put(1,"boy");hashMap.put(2,"girl");hashMap.put(3,"java");String s = hashMap.get(3);System.out.printf("%d,%s",hashMap.size(),s);//【代码】}}
给出下列【代码】注释标注的代码的输出结果。import java.util.*;public class E {public static void main(String args[]) {TreeSet mytree=new TreeSet();mytree.add(100);mytree.add(12);mytree.add(30);mytree.add(9);int m = mytree.first();int n = mytree.last();System.out.printf("%d,%d",m,n);//【代码】}}
给出下列【代码】注释标注的代码的输出结果。import java.util.*;public class E {public static void main(String args[]) {TreeSet mytree=new TreeSet();mytree.add(100);mytree.add(12);mytree.add(30);mytree.add(30);mytree.add(9);mytree.add(9);System.out.printf("%d", mytree.size()); //【代码】}}