Program Java za zaznavanje zanke v povezanem seznamu

V tem primeru se bomo naučili odkriti, ali v LinkedList v Javi obstaja zanka.

Če želite razumeti ta primer, morate poznati naslednje programske teme Java:

  • Java LinkedList
  • Java metode

Primer: zaznaj zanko na povezanem seznamu

 class LinkedList ( // create an object of Node class // represent the head of the linked list Node head; // static inner class static class Node ( int value; // connect each node to next node Node next; Node(int d) ( value = d; next = null; ) ) // check if loop is present public boolean checkLoop() ( // create two references at start of LinkedList Node first = head; Node second = head; while(first != null && first.next !=null) ( // move first reference by 2 nodes first = first.next.next; // move second reference by 1 node second = second.next; // if two references meet // then there is a loop if(first == second) ( return true; ) ) return false; ) public static void main(String() args) ( // create an object of LinkedList LinkedList linkedList = new LinkedList(); // assign values to each linked list node linkedList.head = new Node(1); Node second = new Node(2); Node third = new Node(3); Node fourth = new Node(4); // connect each node of linked list to next node linkedList.head.next = second; second.next = third; third.next = fourth; // make loop in LinkedList fourth.next = second; // printing node-value System.out.print("LinkedList: "); int i = 1; while (i <= 4) ( System.out.print(linkedList.head.value + " "); linkedList.head = linkedList.head.next; i++; ) // call method to check loop boolean loop = linkedList.checkLoop(); if(loop) ( System.out.println("There is a loop in LinkedList."); ) else ( System.out.println("There is no loop in LinkedList."); ) ) )

Izhod

 LinkedList: 1 2 3 4 V LinkedListu je zanka.

V zgornjem primeru smo v Java uvedli LinkedList. Uporabili smo Floydov algoritem za iskanje ciklov, da preverimo, ali v LinkedListu obstaja zanka.

Upoštevajte kodo znotraj checkLoop()metode. Tu imamo dve spremenljivki, imenovani prvi in ​​drugi, ki prečkata vozlišča v LinkedList.

  • prvi - prehod z dvema vozliščema pri posamezni ponovitvi
  • drugi - prehod z 1 vozliščem pri posamezni ponovitvi

Dva vozlišča se premikata z različno hitrostjo. Zato se bodo srečali, če bo prišlo do zanke LinkedList.

Zanimive Članki...