课程: Java Algorithms

今天就学习课程吧！

今天就开通帐号，24,700 门业界名师课程任您挑！

Linked list algorithms: Delete back half of a linked list

Linked list algorithms: Delete back half of a linked list - Java教程

课程: Java Algorithms

开始一个月试用 购买团队方案

Linked list algorithms: Delete back half of a linked list

“

- [Instructor] With data structures built from scratch, we can create more complex algorithms. With data structures built from scratch, we can create more complicated algorithms that manipulate how our data is stored. For example, let's say we want to delete the back half of a linked list. It would be nice to have access to those next pointers because all we would have to do is set the appropriate next pointer, equal to null. We can do this using our custom linked list structure. Inside the class, we have a head node and the node contains a next pointer and some data. In the main method of our algorithms class, we create a linked list and display its contents. With this sample data in place, let's create an algorithm that deletes the back half of this list. We'll put this in the custom linked list class. This will modify the linked list, so it's return value is equal to void. For this algorithm, we'll need to iterate through the linked list. And if we reach the middle node, we'll set…

内容