如何获取length和isEmpty方法作为返回值，以获取用于我的循环链表的方法？

// 节点类
class Node {
    int data;
    Node next;

    public Node(int data) {
        this.data = data;
        this.next = null;
    }
}

// 链表类
class LinkedList {
    private Node head;
    private int length;

    public LinkedList() {
        this.head = null;
        this.length = 0;
    }

    public void insert(int data) {
        Node newNode = new Node(data);

        if (head == null) {
            head = newNode;
            head.next = head;  // 循环链表，头节点指向自己
        } else {
            Node temp = head;
            while (temp.next != head) {
                temp = temp.next;
            }
            temp.next = newNode;
            newNode.next = head;
        }

        length++;
    }

    public void delete(int position) {
        if (isEmpty() || position < 1 || position > length) {
            return;
        }

        if (position == 1) {
            Node temp = head;
            while (temp.next != head) {
                temp = temp.next;
            }
            temp.next = head.next;
            head = head.next;
        } else {
            Node previous = null;
            Node current = head;
            int count = 1;

            while (count < position) {
                previous = current;
                current = current.next;
                count++;
            }

            previous.next = current.next;
        }

        length--;
    }

    public int getLength() {
        return length;
    }

    public boolean isEmpty() {
        return length == 0;
    }
}

// 测试循环链表类
public class Main {
    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        
        list.insert(1);
        list.insert(2);
        list.insert(3);
        
        System.out.println("Length: " + list.getLength());
        System.out.println("Is Empty: " + list.isEmpty());
    }
}