Old zizhu Java tutorial (9)-understanding the history list of list lists

The linked list provides a method to use the linked list as a stack, queue, or dual-end queue. Here, we will not repeat the standard list operations, but will only show how to use it.

Note the Implemented interfaces.

Serializable, cloneable, iterable <E>, collection <E>, deque <E>, list <E>, queue <E>

1. Package collection. lession9;
3. Import java. util. arrays;
4. Import java. util. iterator;
5. Import java. util. Collections list;
6. Import java. util. List;
8. /**
9. * Tutorial on improving Java in old zizhu (6)-understanding the history list of list lists <br>
10. * Two-way queue control, including operations at the beginning and end <br>
11. * It Can Be Used for Stack and FIFO operations. <Br>
12. * <Br>
13. * For more information about APIs, see api.java2000.net/#list.
14. *
15. * @ Author old zizhu Java century network (java2000.net)
16. *
17. */
18. Public class lession9 {
20. Public static void main (string [] ARGs ){
21. // Basic list operations, which are not repeated here
22. // View the list content
23. // Here we focus on the features introduced by the feature list.
24. //
25. Shortlist <string> List = new shortlist <string> ();
26. List. Add ("1111 ");
27. List. Add ("2222 ");
28. List. Add ("3333 ");
30. Showlist (list); // [1111,222 2, 3333]
32. // Add one at the top of the list
33. List. addfirst ("head ");
34. Showlist (list); // [Head, 1111,222 2, 3333]
36. // Test the reverse iterator
37. // The normal iterator should start with the first data
38. // This is from the last one, which is also a feature of the listing list
39. Iterator <string> it = List. descendingiterator ();
40. While (it. hasnext ()){
41. System. Out. Print (it. Next () + ","); // 3333,2222, 1111, Head,
42. }
43. System. Out. println ();
45. // Obtain the first data in the list and keep the data.
46. // Getfirst is used internally, no difference
47. System. Out. println (list. element (); // head
48. System. Out. println (list. getfirst (); // head
49. // If the length is 0, null is returned; otherwise, it is the same as getfirst.
50. System. Out. println (list. Peek (); // head
51. System. Out. println (list. peekfirst (); // head
53. // Obtain the last data in the list and keep the data.
54. System. Out. println (list. getlast (); // 3333
55. // If the length is 0, null is returned; otherwise, it is the same as getlast.
56. System. Out. println (list. peeklast (); // 3333
58. // Add a data entry at the end of the list
59. List. Offer ("tail ");
60. Showlist (list); // [Head, 1111,222 2, 3333, tail]
62. // Add a data entry at the beginning of the List
63. // Implemented internally through addfirst
64. List. offerfirst ("----");
65. Showlist (list); // [----, Head, 1111,222 2, 3333, tail]
67. // Add a data entry at the end of the list
68. // Implemented internally through addlast
69. List. offerlast ("==== ");
70. Showlist (list); // [----, Head, 1111,222 2, 3333, tail, ===]
72. // Obtain the first data in the list and delete the data from
73. System. Out. println (list. Poll ());//----
74. System. Out. println (list. pollfirst (); // head
76. // Obtain the last data in the list and delete the data
77. System. Out. println (list. polllast (); // ====
79. // Store a data in the form of a stack
80. // Insert the element at the beginning of the List
81. // Internal implementation through addfirst
82. List. Push ("XYZ ");
83. Showlist (list); // [xyz, 1111,222 2, 3333, tail]
85. // A data is popped up in the form of a stack.
86. // Remove and return the first data
87. // Internal implementation through removefirst
88. System. Out. println (list. Pop (); // xyz
89. Showlist (list); // [1111,222 2, 3333, tail]
91. // Delete and return the first data
92. System. Out. println (list. removefirst (); // 1111
93. Showlist (list); // [2222,333 3, tail]
95. // Delete the data that appears for the first time in the list
96. // Internal implementation through remove (object)
97. System. Out. println (list. removefirstoccurrence ("3333"); // true
98. Showlist (list); // [2222, tail]
100. // Delete and return the last data
101. System. Out. println (list. removelast (); // tail
102. Showlist (list); // [2222]
104. // Delete the last data in the list
105. System. Out. println (list. removelastoccurrence ("2222"); // true
106. Showlist (list); // []
108. }
110. /**
111. * Displays the data in the list.
112. *
113. * @ Param list
114. */
115. Private Static void showlist (list ){
116. System. Out. println (arrays. tostring (list. toarray ()));
117. }
118. }

Running result

[1111,222, 3333]

[Head, 1111,222 2, 3333]

3333,2222, 1111, Head,

Head

Head

Head

Head

3333

3333

[Head, 1111,222 2, 3333, tail]

[----, Head, 1111,222 2, 3333, tail]

[----, Head, 1111,222 2, 3333, tail, ===]

----

Head

====

[Xyz, 1111,222 2, 3333, tail]

XYZ

[1111,222 2, 3333, tail]

1111

[2222,333 3, tail]

True

[2222, tail]

Tail

[2222]

True

[]

Summary:

This class has great flexibility and is also one of the commonly used List Implementation classes. I will not talk about it anymore. In short, you must master it.