Write a Java function that delete odd nodes from the doubly linked list.

Here is a Java function that deletes odd nodes from a doubly linked list:

class Node {
    int data;
    Node next, prev;
    Node(int data) {
        this.data = data;
        next = prev = null;
    }
}

class LinkedList {
    Node head;

    void deleteOddNodes() {
        Node current = head;
        while (current != null) {
            if (current.data % 2 != 0) {
                if (current == head) {
                    head = current.next;
                    if (head != null)
                        head.prev = null;
                } else {
                    if (current.next != null)
                        current.next.prev = current.prev;
                    if (current.prev != null)
                        current.prev.next = current.next;
                }
            }
            current = current.next;
        }
    }
}

This function works by iterating through the linked list and checking if the data in the current node is odd. If it is, it deletes the node by adjusting the next and prev pointers of the adjacent nodes. If the node to be deleted is the head of the list, it updates the head to the next node.