Leetcode206:反转链表

反转一个单链表。

示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

解法1

//解法1 改变参数的结构
	public ListNode reverseList(ListNode head) {

		ListNode pre = null;
		ListNode cur = head;
		while (cur!=null){
			ListNode next = cur.next;
			cur.next = pre;
			pre = cur;
			cur = next;
		}
		return pre;
	}

解法2

//解法2 不改变参数的结构
	public ListNode reverseList2(ListNode head) {

		Stack<Integer>stack = new Stack<>();
		while (head!=null){
			stack.push(head.val);
			head = head.next;
		}
		if (stack.isEmpty())
			return null;
		ListNode node = new ListNode(stack.pop());
		ListNode cur = node;
		while (!stack.isEmpty()){
			cur.next = new ListNode(stack.pop());
			cur = cur.next;
		}
		return node;
	}