Find middle element of LinkedList [closed]

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0;







up vote
-2
down vote

favorite












 private static String findMiddleElementOfLinkedList(Node head) 
 if (head == null) 
 return null;
 
 Node slowCursor = head;
 if (slowCursor.next != null) 
 Node fastCursor = head.next.next;
 while (fastCursor != null) 
 slowCursor = slowCursor.next;
 fastCursor = fastCursor.next.next;
 
 

 return String.valueOf(slowCursor.data);
 
}



java linked-list




share|improve this question











closed as unclear what you're asking by Sam Onela, Mast, t3chb0t, Dannnno, Graipher Feb 9 at 10:10


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.










  • 2




    there has to be some kind of question here (preferably with some context)
    – Sharon Ben Asher
    Feb 6 at 8:15






  • 1




    It's also completely broken for odd-length lists (due to the unchecked fastCursor.next.next). Please edit the question to include your test set.
    – Toby Speight
    Feb 8 at 13:24

















up vote
-2
down vote

favorite












 private static String findMiddleElementOfLinkedList(Node head) 
 if (head == null) 
 return null;
 
 Node slowCursor = head;
 if (slowCursor.next != null) 
 Node fastCursor = head.next.next;
 while (fastCursor != null) 
 slowCursor = slowCursor.next;
 fastCursor = fastCursor.next.next;
 
 

 return String.valueOf(slowCursor.data);
 
}



java linked-list




share|improve this question











closed as unclear what you're asking by Sam Onela, Mast, t3chb0t, Dannnno, Graipher Feb 9 at 10:10


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.










  • 2




    there has to be some kind of question here (preferably with some context)
    – Sharon Ben Asher
    Feb 6 at 8:15






  • 1




    It's also completely broken for odd-length lists (due to the unchecked fastCursor.next.next). Please edit the question to include your test set.
    – Toby Speight
    Feb 8 at 13:24













up vote
-2
down vote

favorite









up vote
-2
down vote

favorite











 private static String findMiddleElementOfLinkedList(Node head) 
 if (head == null) 
 return null;
 
 Node slowCursor = head;
 if (slowCursor.next != null) 
 Node fastCursor = head.next.next;
 while (fastCursor != null) 
 slowCursor = slowCursor.next;
 fastCursor = fastCursor.next.next;
 
 

 return String.valueOf(slowCursor.data);
 
}



java linked-list




share|improve this question











 private static String findMiddleElementOfLinkedList(Node head) 
 if (head == null) 
 return null;
 
 Node slowCursor = head;
 if (slowCursor.next != null) 
 Node fastCursor = head.next.next;
 while (fastCursor != null) 
 slowCursor = slowCursor.next;
 fastCursor = fastCursor.next.next;
 
 

 return String.valueOf(slowCursor.data);
 
}




java linked-list





share|improve this question










share|improve this question




share|improve this question









asked Feb 5 at 23:43









TheLearner

400311




400311




closed as unclear what you're asking by Sam Onela, Mast, t3chb0t, Dannnno, Graipher Feb 9 at 10:10


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.






closed as unclear what you're asking by Sam Onela, Mast, t3chb0t, Dannnno, Graipher Feb 9 at 10:10


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.









  • 2




    there has to be some kind of question here (preferably with some context)
    – Sharon Ben Asher
    Feb 6 at 8:15






  • 1




    It's also completely broken for odd-length lists (due to the unchecked fastCursor.next.next). Please edit the question to include your test set.
    – Toby Speight
    Feb 8 at 13:24













  • 2




    there has to be some kind of question here (preferably with some context)
    – Sharon Ben Asher
    Feb 6 at 8:15






  • 1




    It's also completely broken for odd-length lists (due to the unchecked fastCursor.next.next). Please edit the question to include your test set.
    – Toby Speight
    Feb 8 at 13:24








2




2




there has to be some kind of question here (preferably with some context)
– Sharon Ben Asher
Feb 6 at 8:15




there has to be some kind of question here (preferably with some context)
– Sharon Ben Asher
Feb 6 at 8:15




1




1




It's also completely broken for odd-length lists (due to the unchecked fastCursor.next.next). Please edit the question to include your test set.
– Toby Speight
Feb 8 at 13:24





It's also completely broken for odd-length lists (due to the unchecked fastCursor.next.next). Please edit the question to include your test set.
– Toby Speight
Feb 8 at 13:24











1 Answer
1






active

oldest

votes

















up vote
1
down vote













fastCursor = fastCursor.next.next; will crash if the number of nodes in the list is even (but greater than zero).






share|improve this answer





















  • Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
    – TheLearner
    Feb 6 at 3:05







  • 1




    You need to try 4 :)
    – RobAu
    Feb 6 at 8:09

















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
1
down vote













fastCursor = fastCursor.next.next; will crash if the number of nodes in the list is even (but greater than zero).






share|improve this answer





















  • Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
    – TheLearner
    Feb 6 at 3:05







  • 1




    You need to try 4 :)
    – RobAu
    Feb 6 at 8:09














up vote
1
down vote













fastCursor = fastCursor.next.next; will crash if the number of nodes in the list is even (but greater than zero).






share|improve this answer





















  • Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
    – TheLearner
    Feb 6 at 3:05







  • 1




    You need to try 4 :)
    – RobAu
    Feb 6 at 8:09












up vote
1
down vote










up vote
1
down vote









fastCursor = fastCursor.next.next; will crash if the number of nodes in the list is even (but greater than zero).






share|improve this answer













fastCursor = fastCursor.next.next; will crash if the number of nodes in the list is even (but greater than zero).







share|improve this answer













share|improve this answer



share|improve this answer











answered Feb 5 at 23:51









200_success

123k14143401




123k14143401











  • Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
    – TheLearner
    Feb 6 at 3:05







  • 1




    You need to try 4 :)
    – RobAu
    Feb 6 at 8:09
















  • Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
    – TheLearner
    Feb 6 at 3:05







  • 1




    You need to try 4 :)
    – RobAu
    Feb 6 at 8:09















Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
– TheLearner
Feb 6 at 3:05





Can you provide me with an example of this case? I tested this code with one node, two nodes and 6 nodes.
– TheLearner
Feb 6 at 3:05





1




1




You need to try 4 :)
– RobAu
Feb 6 at 8:09




You need to try 4 :)
– RobAu
Feb 6 at 8:09


-

Popular posts from this blog

Greedy Best First Search implementation in Rust

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite I have implemented a Greedy Best First Search algorithm in Rust, since I couldn't find an already implemented one in the existing crates. I have a small pet project I do in Rust, and the Greedy BFS is at the core of it. The algorithm is designed to be as flexible as possible. Theoretically, this algorithm could be used as a greedy depth-first search or as a greedy a*. I want to design a good algorithm that I could later use in any other project needing it, not only this one. I am quite new to Rust and this is the second project I do in this language. Also, I am new to writing optimized algorithms. Since this search will be called often, my main concern is performance. What are some tips and tricks to make the algorithm perform better? Of course any other critique and comment is welcome. Bellow is the code: //! Here is
Read more

Function to Return a JSON Like Objects Using VBA Collections and Arrays

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite My goal is to create a compact function that can create a JSON Like object from JSON string. I want a function with a small footprint that I or anyone who wants to use it, can simply paste into a module and use. At 61 lines of code, I am happy with its size and portability. Here is an image of JSON Object created from string data using a ScriptControl . Although the Locals Window displays the properties and values correctly, the object itself is extremely difficult to work with. This image shows an object created using getJSONCollection . Because it is made of VBA Collections and Arrays, it is very easy to work with. Option Explicit Private Function getJSONCollection(ByVal Value As Variant, Optional ScriptEngine As Object) As Variant Const DELIMITER As String = "||" Dim col As Collection, JSON As Object, KeyNam
Read more

C++11 CLH Lock Implementation

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite 1 As a hobbyist programmer I have been reading "The Art of Multiprocessor Programming" (Herlihy, Maurice; Shavit, Nir) and converting the Java spin locks into C++ - I have enjoyed this and learned a lot. I have implemented the CLH spin queue lock (due to Travis Craig, Erik Hagersten, and Anders Landin) but I feel unhappy about the way that I have the raw pointers interacting with smart pointers and would be grateful for code review advice. As I understand it I must use a smart pointer, in this case std::unique_ptr , for my thread local node pointer or the lock will not deallocate properly and the clh_lock will leak. But... I also have no choice but to use a raw atomic tail queue pointer in order access the atomic exchange member function. Therefore, I have to come up with some combination of either, raw or smart
Read more