java学习笔记(java学习笔记).docVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
java学习笔记(java学习笔记)

java学习笔记(java学习笔记) 1, the difference between Collection and Collections? Collection is the higher-level interface of the collection class, and the interfaces inherited from it are mainly Set and List. Collections is a help class for collection classes. It provides a series of static methods that implement sorting, searching, and thread safety for a variety of collections. 2, list, map, set List dynamic collection interface, the advantage is that you can add elements dynamically. It is convenient to traverse the collection elements through the Itractor iterator. Map is the collection of key value pairs, and the advantage is that you can find the corresponding value by the corresponding key, just like a key with a corresponding lock. Set is also a collection of relational mechanisms between its adjacent two elements, and the advantage is that it facilitates the lateral search of adjacent set elements, However, once one of the elements is deleted, the relationship between the adjacent elements must be changed, and it is not convenient to add and delete elements dynamically. The difference between List, Map, Set List interface to Collection a simple expansion, and its specific implementation classes are commonly used ArrayList and LinkedList. You can put anything in a List container and take it out when you need it. From the name of ArrayList can see that it is a similar array is stored, so its random access speed, and LinkedList internal implementation is the list, it is suitable for the need in the middle of the list of frequent insertion and deletion. In specific applications, you can choose freely as needed. The previous Iterator can only do a forward traversal of the container, while ListIterator inherits the idea of Iterator and provides a bidirectional traversal of the List. The Set interface is also an extension of Collection, and unlike List, the object elements in Set cannot be repeated, that is, you cannot put the same thing two times in the same Set containe

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档