链表每K个节点进行反转

最新推荐文章于 2024-01-15 05:00:00 发布

原创最新推荐文章于 2024-01-15 05:00:00 发布 · 3.5k 阅读

1 ·

CC 4.0 BY-SA版权

数据结构和算法专栏收录该内容

31 篇文章

订阅专栏

本文探讨了如何在链表中每K个节点处进行反转操作，涉及链表的遍历、翻转技巧以及相关算法实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package List;

public class Node<V> {
    V value;
    Node<V> next;
    public Node(V value){
        this.value = value;
    }
    public static void printList(Node head){
        Node node = head;
        while(node != null){
            System.out.print(node.value + " ");
            node = node.next;
        }
        System.out.println();
    }

}

package List;

public class EveryKReverse {
    /**
     * 单链表每K个节点反转
     */
    public static Node everyKReverse(Node head, int k){
        if(head == null || head.next == null || k <= 1){
            return head;
        }
        Node newHead = null, newEnd = null;

        while(head != null){
            Node newHeadTmp = null, newEndTmp = null;
            int count = k;
            while(head != null && count > 0){
                if(count == k){
                    newEndTmp = head;

                }
                Node tmp = newHeadTmp;
                newHeadTmp = head;
                head = head.next;
                newHeadTmp.next = tmp;
                count--;
            }
            if(newHead == null){
                newHead = newHeadTmp;
            }else{
                newEnd.next = newHeadTmp;
            }
            newEnd = newEndTmp;
        }
        return newHead;

    }
    public static void main(String[] args){
        Node head = new Node(1);
        Node head1 = new Node(2);
        Node head2 = new Node(3);
        Node head3 = new Node(5);
        head.next = head1;
        head1.next = head2;
        head2.next = head3;
        Node.printList(head);
        Node newHead = everyKReverse(head, 3);
        Node.printList(newHead);
    }
}