Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Replacing Node Value
Hey Guys, Could somebody point me in the right direction to replacing a node in a linked list?
I have no clue on where to start, thus. I have no code to supply.
I current have, a destory method, a find, a destroyFirstNode, a destroyLastNode, print, insert, etc etc... But I just have no clue on how to replace the nodes value....
Any pointers?
I don't want code, I actually want to learn, not memorise.
Cheers, Pete.
Related threads:
Re: Replacing Node Value
To replace one node in a linked list with another node, copy the pointers and set the pointers that are used to put the new node in the list.
To see what pointers need to be changed, take a piece of paper, draw some nodes in a linked list with the pointers that connect the nodes. Draw a new node outside of the linked list next to a node in the list. Then see what pointers need to be changed to put the new node in the list replacing the node that is in the list.
Whoops, the above is to replace a node.
To change the value that a node holds, find the node in the list and call the node's set method to change its contents.
If you don't understand my answer, don't ignore it, ask a question.
ProgrammablePeter (March 30th, 2014)
Re: Replacing Node Value
public Node replace(Object data, Object value) { Node current = head; while(current != null) { if(current.getData() == data) { current.setData(value); return current; } current = current.getNext(); } return null; }
This works! Thanks man! Actually took me a while to figure it out, cheers! You're a star!
Reply With Quote