LinkList reverse and normal order construction

cloneAndReverse.java

public static Node reverseAndClone(Node list) {
		Node head = null;
		while (list != null) {
			Node n = new Node(list.val);
			n.next = head;
			head = n;
			list = list.next;
		}
		return head;
	}
  
  // the difference between normal order and reverse order is head.next = n;
  
  public static Node cloneList(Node list) {
		Node head = null;
		while (list != null) {
			Node n = new Node(list.val);
			head.next = n; // this is the difference between cloneAndReverse(Node list)
			head = n;
			list = list.next;
		}
		return head;
	}