[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fefAO6sYOGOHEFosUNhrUl48iiGOujQuRdXIb4WLyyEE":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":24,"origin":111,"createTime":26},264638532,"v1","在Java中,LinkedList 与 ArrayList 相比,以下哪个操作是 LinkedList 更高效的",[8,9,10,11],"随机访问(按索引访问)","在列表末尾添加元素","在列表中间频繁地插入和删除元素","排序",[],[14,27,37,41,51,61,71,81,91,101],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},264638530,"关于Collection接口,以下说法正确的是",[18,19,20,21],"Collection 接口直接提供了 get(int index) 方法用于按索引获取元素","Collection 接口是 Map 接口的父接口","Collection 接口的 removeIf(Predicate\u003C? super E> filter) 方法是Java 8新增的默认方法","所有实现了 Collection 接口的类都保证元素是有序的",[],[],0,null,"2025-12-14T18:32:15+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":35,"related":36,"type":24,"origin":25,"createTime":26},264638531,"分析以下代码,选择正确的输出结果:List\u003CString> list = new ArrayList\u003C>();list.add(\"One\");list.add(\"Two\");list.add(\"Three\");List\u003CString> subList = list.subList(1, 2);subList.add(\"Four\");System.out.println(list)",[31,32,33,34],"[One, Two, Three]","[One, Two, Four, Three]","[One, Two, Four]","[One, Two, Three, Four]",[],[],{"id":4,"source":5,"question":6,"options":38,"answer":39,"related":40,"type":24,"origin":25,"createTime":26},[8,9,10,11],[],[],{"id":42,"source":5,"question":43,"options":44,"answer":49,"related":50,"type":24,"origin":25,"createTime":26},264638533,"关于 Set 集合,以下代码的输出是什么?Set\u003CNumber> set = new HashSet\u003C>();set.add(100);set.add(100L);set.add(100.0);System.out.println(set.size())",[45,46,47,48],"1","2","3","编译错误",[],[],{"id":52,"source":5,"question":53,"options":54,"answer":59,"related":60,"type":24,"origin":25,"createTime":26},264638534,"要实现一个既按插入顺序迭代,又保证元素唯一的集合,应使用",[55,56,57,58],"HashSet","TreeSet","LinkedHashSet","CopyOnWriteArraySet",[],[],{"id":62,"source":5,"question":63,"options":64,"answer":69,"related":70,"type":24,"origin":25,"createTime":26},264638535,"以下关于 TreeSet 的说法,错误的是",[65,66,67,68],"放入 TreeSet 的元素必须实现 Comparable 接口,或者在构造时传入一个 Comparator","TreeSet 判断元素是否相等的依据是 compareTo 或 compare 方法的返回值是否为0,而不是 equals 方法","TreeSet 是线程安全的","TreeSet 的 add, remove, contains 操作的时间复杂度均为 O(log n)",[],[],{"id":72,"source":5,"question":73,"options":74,"answer":79,"related":80,"type":24,"origin":25,"createTime":26},264638536,"关于 Map 接口,以下说法正确的是",[75,76,77,78],"Map 的 keySet() 方法返回的 Set 视图是原 Map 所有键的副本,修改它不会影响原 Map","可以使用 null 作为 HashMap 的键和值","Hashtable 允许 null 作为键和值","ConcurrentHashMap 允许 null 作为键和值",[],[],{"id":82,"source":5,"question":83,"options":84,"answer":89,"related":90,"type":24,"origin":25,"createTime":26},264638537,"以下哪种方式可以正确地遍历一个 Map\u003CString, Integer> 并同时修改(删除)其元素",[85,86,87,88],"使用 for-each 循环遍历 map.keySet(),并在循环体内调用 map.remove(key)","使用 for-each 循环遍历 map.entrySet(),并在循环体内调用 map.remove(entry.getKey())","使用 Iterator 遍历 map.entrySet(),并使用 Iterator 的 remove() 方法","使用Java 8的 map.forEach((k, v) -> map.remove(k))",[],[],{"id":92,"source":5,"question":93,"options":94,"answer":99,"related":100,"type":24,"origin":25,"createTime":26},264638538,"Collections.synchronizedCollection(Collection c) 方法返回的集合是线程安全的,以下关于它的描述正确的是",[95,96,97,98],"在使用返回的集合进行迭代时,仍然需要手动同步","返回的集合在所有方法上都使用了 synchronized 块,因此迭代时不需要额外同步","它比 java.util.concurrent 包下的并发集合(如 CopyOnWriteArrayList)性能更好","它返回的集合在序列化时与原始集合行为一致",[],[],{"id":102,"source":5,"question":103,"options":104,"answer":109,"related":110,"type":24,"origin":25,"createTime":26},264638539,"关于迭代器 Iterator,以下说法错误的是",[105,106,107,108],"Iterator 的 remove() 方法可以在遍历时安全地删除元素","在调用 Iterator 的 next() 方法之前,必须先调用 hasNext() 方法进行检查","一个 Iterator 对象只能使用一次,无法重置","ListIterator 是 Iterator 的子接口,它只允许向后遍历,不允许向前遍历",[],[],{"courseName":112,"courseImg":113,"workName":114,"workId":115,"count":116,"courseId":117},"面向对象程序设计","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3d3ce3211bdca2c4cadf5d4677470040.png","集合与泛型-2025112020","work_48382920",91,"a04c1a329d7eb61add1a9740b3c6a505"]