List，Set，Map，Queue，Deque，Stack的遍历方式

快来打我* 2024-05-07 17:11 50阅读 0赞

**1.List(有序，允许重复)的遍历方式**

// List的实现类
    LinkedList<String> list1 = new LinkedList<String>(); // 基于双向链表的集合
    ArrayList<String> list2 = new ArrayList<String>(); // 单列集合

方式一：for循环

![620667d5824e40828221a58bfd064ae7.png][]

方式二：for...each循环

![0814ee57171c4618a6fadf33c7c79dcf.png][]

方式三：迭代器遍历

![8166f1385e1943a88db442d7e274afa3.png][]

**2.Set(无序，不允许重复（实现类中treeSet可自动排序,LinkedHashSet有序）)的遍历方式**

// Set的实现类(Set接口不保证有序，SortedSet接口保证元素有序)
    HashSet<String> set1 = new HashSet<String>(); // 无序，不允许重复
    LinkedHashSet<String> set2 = new LinkedHashSet<String>(); // 有序，不允许重复
    TreeSet<String> set3 = new TreeSet<String>(); // 有序，不允许重复(实现SortedSet接口)

方式一：for...each循环

![326ff7539be44c03b42e4d70374ec05e.png][]

方式二：iterator迭代器遍历

![295d5c2b57a64e65b43a0becebd18228.png][]

**3.Map(无序，唯一（实现类中LinkedHashMap有序）)的遍历方式**

// Map(键值对集合)(无序且唯一)的实现类
    HashMap<String, Integer> map = new HashMap<String, Integer>(); 
    HashMap<String, String> linkedMap = new LinkedHashMap<String, String>(); // 有序		
    Map<String,String> treeMap = new TreeMap<String,String>(); // treeMap是Map的子类

方式一:for...each循环

![72168f7c88f24b76b753c2c1506d3543.png][]

方式二：遍历Map对象的entrySet()集合

![65f8e66998584931829e11d2940d261c.png][]

**4.Queue(先进先出)的遍历方式**

Queue<String> queue = new LinkedList<String>();
            queue.offer("yellow");
            queue.offer("white");
            queue.offer("pink");
            queue.offer("blue");

方式1：for...each循环

![c2e8e9522fa8475b8fe2faa26d56bd08.png][]

方式2：iterator迭代器遍历

![ca93d3203459478b8a659da9c40bc1b8.png][]

**5.Deque(双端队列)的遍历方式**

Deque<String> d = new LinkedList<String>();
            d.offer("blue");
            d.offer("yellow");
            d.offer("white");
            d.offer("pink");

方式1.for...each循环

![f2374a6fed6f4f54800258b3d504b2cb.png][]

方式2.while循环

![504472e53db44f8f96c9c56979537865.png][]

方式3.iterator迭代器遍历

![e4aaaa6ce96d458599f724d8a43b4f57.png][]

**6.Stack(先进后出)的遍历方式**

**Stack<String> stack = new Stack<String>();  
stack.push("A1");  
stack.push("A2");  
stack.push("A3");  
stack.push("A4");  
stack.push("A5");**

方式1：遍历并出栈---->while循环（后进先出）

![8f0f05a409ac48d6b6e9d865b9f7fd11.png][]

方式2：for...each循环(先进先出)

![60ac6c61d4cc45c7b3754f9b36320090.png][]

方式3：Iterator迭代器遍历(先进先出)

![e5730bd009c247a782ee8ac203bdcfad.png][]

[620667d5824e40828221a58bfd064ae7.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/8de35c5d96e141019e7133186c505023.png
[0814ee57171c4618a6fadf33c7c79dcf.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/662bbce3e8ab44c4af146b7584ee4013.png
[8166f1385e1943a88db442d7e274afa3.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/fb51dc91dc7b40a1aab85373b8c1dcfa.png
[326ff7539be44c03b42e4d70374ec05e.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/45d3b3fd761e4e15b62fbdad1c78e60c.png
[295d5c2b57a64e65b43a0becebd18228.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/36965516df0b4721802b440ee78a5b3a.png
[72168f7c88f24b76b753c2c1506d3543.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/7652750124d74a88bb27fc60af2224d8.png
[65f8e66998584931829e11d2940d261c.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/5c008f9a558b4967938bc13ba0151b51.png
[c2e8e9522fa8475b8fe2faa26d56bd08.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/9dfe71422f304d4686cd7195d112dfb7.png
[ca93d3203459478b8a659da9c40bc1b8.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/201e30d8b7e7423882db5dab7d935ed3.png
[f2374a6fed6f4f54800258b3d504b2cb.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/2ef97d8ecebe43fa81002181a5e031bd.png
[504472e53db44f8f96c9c56979537865.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/087482c431194e3a99ce4f955cee0c74.png
[e4aaaa6ce96d458599f724d8a43b4f57.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/6051207740db44c4b3d89120467b03bc.png
[8f0f05a409ac48d6b6e9d865b9f7fd11.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/26a8a0f22bf9493a85384bbc87edc4fe.png
[60ac6c61d4cc45c7b3754f9b36320090.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/55bfe977204e4ccaaec6f777385d841c.png
[e5730bd009c247a782ee8ac203bdcfad.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/05/07/c8c875e936cd4f12bb295d565b75cc33.png