Java one-way list operation detailed

Transferred from: http://blog.csdn.net/zxman660/article/details/7786354

——————————————————————————————————————————

2. /* First define a node class to store the domain and pointer fields of the nodes
4. * That is, the value in the current node and the method of the back node
6. * in C is equivalent to defining a struct type a data field and a pointer field method
8. */
10. Class lnode{//This is already very fixed. Set two properties using the Set function and the Get function to get these two properties
12. private int data;
14. private Lnode Next; //This and string should have a similar usage, the class name is used to represent the data type, which means that the next data type is also the node
16. public void SetData (int data) {
18. this.data = data;
20. }
22. public int GetData () {
24. return This.data;
26. }
28. public void Setnext (Lnode next) {
30. This.next = next;
32. }
34. Public Lnode GetNext () {
36. return This.next;
38. }
40. }
42. /*
44. * Define a list of main classes, and define a variety of methods for the operation of the list
46. */
48. Public class Linklist {
52. Public Lnode head; //Define a head node
56. /*
58. * Define a method for creating a linked list
60. * This method is called: Tail interpolation: The newly generated node inserts the linked list from the tail
62. */
64. public void Createlink (int [] a) {
66. Lnode pnew; //define pnew to represent newly generated nodes .
68. Lnode ptail=New Lnode (); Allocating heap memory for tail nodes
70. Head=ptail; //Initially the head node is equal to the tail.
72. For (int i=0;i<a.length;i++) {
74. pnew=new Lnode (); Allocating heap memory for newly generated nodes
76. Pnew.setdata (A[i]); //Pass data value
78. Ptail.setnext (pnew); //Set the newly created node to the successor of the Ptail
80. Pnew.setnext (null); Set the successor node of the newly created node to null
82. Ptail=pnew; //Move the Ptail node position so that it always points to the tail
84. }
86. }
90. /*
92. * Define a method for determining the existence of elements in a linked list
94. */
96. public void Seachlink (int value) {
98. Lnode ptr;
100. Ptr=head.getnext ();
102. while (ptr!=null) {//search for a matching value in the case of non-empty nodes
104. if (Value==ptr.getdata ()) {//Match succeeded Yes
106. System.out.println ("Find data:" +ptr.getdata ());
108. Break ; //exit loop
110. }
112. else{//When the current value is not the value you are looking for, find the next
114. Ptr=ptr.getnext ();
116. }
118. }
120. if (ptr==null)//list traversal completed, when not found
122. System.out.println ("There is no data to find in the list");
124. }
126. /*
128. * Define a method for deleting nodes
130. */
132. public void Deletelink (int value) {
134. Lnode ptr;
136. Lnode p;
138. P=head;
140. Ptr=head.getnext ();
142. While (ptr!=null) {
144. if (Value==ptr.getdata ()) {//Determines whether the current value in the linked list is the node to be deleted
146. P.setnext (Ptr.getnext ()); //Set the successor node of PTR to the successor of P, that is, the PTR node is deleted in form in the list.
148. //System.GC ();
150. System.out.println ("Delete data" +value+ "success!"  ");
152. Break ;
154. }
156. else{
158. P=ptr; //p pointing to the PTR location
160. Ptr=ptr.getnext (); //ptr Point to its direct successor position
162. }
164. }
166. if (ptr==null)
168. System.out.println ("There is no data in the list to delete!")  ");
170. }
172. /*
174. * Methods for defining the insertion node
176. */
178. public void Insertlink (int pos,int value) {//two parameters, one representing the insertion position, and the other representing the inserted value
180. Lnode ptr;
182. Lnode pnew; //instantiation of new node
184. Ptr=head.getnext ();
186. While (ptr!=null) {
188. if (Pos==ptr.getdata ()) {
190. pnew=new Lnode ();
192. Pnew.setdata (value);
194. Pnew.setnext (Ptr.getnext ());
196. Ptr.setnext (pnew); //   
198. System.out.println ("Insert Data" +value+ "success!")  ");
200. Break ;
202. }
204. else{
206. Ptr=ptr.getnext ();
208. }
210. }
212. if (ptr==null)
214. System.out.println ("Insert data failed!  ");
216. }
224. /*
226. * Define an output link table content method
228. */
230. public void Printlink () {
232. Lnode ptr; //instantiation of a node
234. Ptr=head.getnext (); //The node obtains the successor of the head node.
236. While (ptr!=null) {
238. System.out.print (Ptr.getdata () +"-");
240. Ptr=ptr.getnext ();
242. }
244. System.out.println ("NULL");
246. }
250. /*
252. * Below is a test case that creates an integer linked list with an array and outputs it
254. */
256. public static void Main (String args[]) {
258. int a[]=new int [10];
260. For (int i=0;i<a.length;i++) {
262. A[i]=i;
264. }
266. linklist list=new linklist ();
268. List.createlink (a);
270. System.out.println ("linked list output is as follows:");
272. List.printlink ();
274. System.out.println ("The output of the linked list after inserting an element is as follows:");
276. List.printlink ();
280. }
282. }

Java one-way list operation detailed