singly linked list java

Write a data structure that everyone is familiar with: one-way linked list.But first tell everyone a small secret, Java API has provided a one-way list of the class, you can directly to use, but the study of data structure course when you have already know, although the system will provide us with some commonly used data structure, but the custom can always bring

. GetSize());System. out. println("is empty?"+ DLQ. IsEmpty());for (int i =0; i Dlq. Insertfirst(i);} System. out. println("Size:"+ DLQ. GetSize());System. out. println("is empty?"+ DLQ. IsEmpty());Dlq. Getallelements();System. out. println(DLQ. GetFirst());System. out. println(DLQ. GetLast());for (int i =0; i Dlq. Insertlast(i +1);} System. out. println("Size:"+ DLQ. GetSize());System. out. println("is empty?"+ DLQ. IsEmpty());Dlq. Getallelements();System. out. println(DLQ. GetFirst());System.

The question of whether a single-linked list has a ring is often encountered during an interview, where an O (1) is required in the general interview, and if there is a ring, the starting position of the ring is obtained.The following is implemented in Java.//Single linked listClasslistnode{intVal; ListNode Next; L

1 /*two-way linked list features:2 * * Each node contains two references, Previos and next, supporting forward or backward traversal (except the head node)3 when inserting or deleting a defect, it involves more than a reference modification .4 * Note: The following doubly linked list actually implements the double-ende

Since there is no struct in Java, a class is used to define the linked list, and the code is as followsIncludes a data, and a pointer to the next nodeRewrite the ToString function to return the data you wantDefine the class of the linked list:Package Linknode;public class Linknode {public String data;Public Linknode Ne

1 classLnode2 {3 PublicLnode Next;4 Public intdata;5 }6 /*Reverse Linked list*/7 classNizhi8 {9 Private StaticLnode head =NewLnode ();Ten Private Staticlnode node; One Private StaticLnode tail; A Private Static intindex; - Private StaticLnode Newhead =NewLnode (); - Public Static voidMain (string[] args) { the int[] Nums = {1,2,3,4,5,6,7,8,9,10}; -Head.data = Nums

distance is XCycle Length: YQuick pointer one step at a time two slow handsIf the meeting point is m (distance from the start point of the Loop), m must be inside the loop.Fast pointer Movement Distance: X + KY + m slow pointer move distance: x + ty + MX+ky+m = 2 (x+ty+m)= = KY = 2ty + x + m = = (x + m) MoD y = 0So the quick pointer then runs x distance to reach the starting point of the loop.Code:1 PublicListNode detectcycle (ListNode head) {2 if(head==NULL|| head.next==NULL)3

Forest Wood Blog Website: http://blog.csdn.net/wolinxuebinReference website: http://blog.csdn.net/sunsaigang/article/details/5751780Descriptive narrative: The function of simple single-linked list with Java implementationDefines a MyList classThe included functions are:GetHead () returns the head pointer.IsEmpty () whether the inference is null;AddFirst (T Elemen

++; } /*** Convert a doubly linked list into a unary array: from the beginning to the tail. * */ Publicobject[] ToArray () {object[] result=NewObject[size]; inti = 0; for(linkednodeNULL; node =Node.getnext ()) Result[i++] =Node.getvalue (); returnresult; } /*** Reverse Rotation **/ Public voidreverse () {if(first==NULL|| last==NULL) return; Linkednodeprev; Linkedno

public String getName (); Get the name of the pet public int getage (); Get pet Age}class petshop{//pet store class private link pets = new link ()///Multiple pets with linked list public void Add (Pet Pet) {//pet shelfThis.pets.add (PET); } public void Remove (Pet pet) {//Lower frame this.pets.remove (PET); } Public link search (String keyWord) {//implement fuzzy query because you

Linked list is a set of arbitrary storage units to store linear table data units, linked list consists of two parts: node (data field), pointer field. Access to the entire list must start from the beginning of the pointer, the head pointer points to the first node, and the l

) {//Get specified position node element node Prenode=Head; intCount=0; while(count!=POS) {Prenode=Prenode.right; ++count; } returnPrenode.data; } Public BooleanDelete (node node) {//Delete node node Curnode=Head; while(curnode!=nodecurnode!=NULL) {Curnode=Curnode.right; } if(curnode!=node) { return false; } if(curnode.right!=NULL) {CurNode.left.right=Curnode.right; CurNode.right.left=Curnode.left; --length; return true; } if(curnode.right==NULL) {Cur

Head.setnext (null) after the reversal, and//The head node is set to the first node of the inverted list, then back to Okhead = pre; return head;}Recursive method:/** * Recursive thought * before flipping the current node, if the node has subsequent nodes, flip its successor node first * If the node has no child nodes, then point the node's next to its parent node and the parent node's next to NULL * @param head * @return */public Static ListNode rev

Consolidating the data structure single-link list Java implementation single-link list in addition to the footer each point has a successor node has data and subsequent pointers are composed by building the header and footer (trailing append required) two special points to implement a single-linked

* Each node in the list that holds the reference to the previous node and a reference to the next node* Relative to a generic collection, a linked list is an ordered set, and the position of each object is very important* Add by default is added to the tail of the list** Adding deletions to lists is often done with ite

About the basic operation of the linked list in the data structure (C language Implementation) where the detailed description, now I will use Java to implement a single-linked listIt's not going to be a detailed explanation.0. Write a node class to act as a node model./* * Node in the

A struct variable, can only do two kinds of operations,Overall reference (assignment, parameter passing)or Access members (point arithmetic-address mode simplification, address mode) (see the Last picture)Case million:Conclusion: Class node in Java, node p; P is the entity itself, and the P pointer operates directly between nodes.and c inside the struct Lnode *p can only be indirectly to operate a node is not this node of the nativeC-Operators directl

-Linked List-is a non-sequential, non-sequential storage structure on a physical storage unit, and the logical order of the data elements is achieved through the order of the pointers in the linked list. A linked list consists of

; String key) {Cktype node,temp; Node=Head; Temp=Head; while(temp!=NULL) { if(Temp.nodeData.key.compareTo (Key) ==0) {Node.nextnode=Temp.nextnode; Temp=NULL; return1; } ELAS {Note=temp; Temp=Temp.nextnode; } } return0;} Vii. calculation of the chain table lengthint Cllength (Cltype head) { Cltype temp; = head; int length=0; while (temp!=null) { length+ +; Temp=temp.nextnode; } return length;}Eight. S

if(Head.next.data.equals (key)) { theSystem.out.print ("Query node:" + key + ","); theSystem.out.print ("Query node predecessor node is:" + Head.data + ","); the if(Head.next.next! =NULL) {98SYSTEM.OUT.PRINTLN ("Query node post node is:" +head.next.next.data); About}Else { -SYSTEM.OUT.PRINTLN ("Query node is tail node!"));101 }102 return;103 }104Head =Head.next; the }106System.out.println ("No this node!"));107