3 Ways to traverse the list collection

2. Package com.sort;
6. Import java.util.ArrayList;
8. Import Java.util.Iterator;
10. Import java.util.List;
14. /**
16. * List of three kinds of traversal
18. *
20. */
22. Public class Listtest {
26. public static void Main (string[] args) {
30. list<string> list = new arraylist<string> ();
34. List.add ("a");
36. List.add ("B");
38. List.add ("C");
40. List.add ("C"); Can add duplicate data
44. //Traversal method one
46. For (iterator<string> Iterator = List.iterator (); Iterator.hasnext ();) {
48. String value = Iterator.next ();
52. System.out.println (value);
54. }
58. //Traversal method two
60. For (String value:list) {
62. System.out.println (value);
64. }
68. //Traverse method three
70. For (int i=0;i<list.size (); i++) {
72. System.out.println (List.get (i));
74. }
78. }
80. }

Comparative analysis of three types of traversal:

Method One traversal:

Data locks are performed during execution, and performance is slightly worse, and you can only invoke the It.remove method if you want to remove an element from the loop.

Method two times:

Internal invocation of the first

Method Three traversal:

Internal not locked, the most efficient, but when writing multi-threading to consider the problem of concurrent operation

The two main implementations of the list interface, ArrayList, and LinkedList, can be used in such a way to traverse

A comparative analysis of ArrayList and LinkedList
A) ArrayList the bottom of the array implementation, linkedlist the bottom of the two-way linked list implementation.
b) When performing an insert or delete operation, it is better to use LinkedList.
c) When performing a search operation, it is better to use ArrayList.

To be blunt, sequential storage and chained storage in data structures

3 Ways to traverse the list collection