Share my non-recursive Java solution

Node Reverse(Node head) {
    Node temp = head;
    Node newHead = head;
    while (temp != null) {
        Node prev = temp.prev;
        temp.prev = temp.next;
        temp.next = prev;
        newHead = temp;
        temp = temp.prev;
    }
    return newHead;
}