public class Demo {
public static void main(String[] args) {
// 求链表的中间结点
Node node = getNode(4);
Node findMiddleNode = findMiddleNode(node);
print(findMiddleNode);
}
// 求中间结点
public static Node findMiddleNode(Node list) {
if (list == null)
return null;
Node fast = list;
Node slow = list;
// 1 2 3 4
// 偶数节点链表中间位置前面一个节点(2)
while (fast.next != null && fast.next.next != null) {
fast = fast.next.next;
slow = slow.next;
}
// 偶数节点链表中间位置后面一个节点(3)
// while (fast != null && fast.next != null) {
// fast = fast.next.next;
// slow = slow.next;
// }
System.out.println(slow.value);
return slow;
}
private static Node getNode(Integer n) {
Node node = null;
Node head = null;
for (int i = 1; i <= n; i++) {
Node next = new Node(i);
if (node == null) {
node = next;
head = next;
} else {
node.next = next;
node = next;
}
}
return head;
}
private static void print(Node node) {
StringBuilder s = new StringBuilder();
while (node != null) {
if (s.length() == 0) {
s.append(node.value);
} else {
s.append(" --> " + node.value);
}
node = node.next;
}
System.out.println(s.toString());
}
static class Node {
Node next;
Integer value;
Node(Integer value) {
this.value = value;
}
}
}
数据结构与算法(五)——求链表的中间结点
最新推荐文章于 2024-07-18 16:41:02 发布