剑指数据结构-单链表反转

反转单链表

示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
//递归
private ListNode reverse(ListNode head){
        //单链表为空
         if (head == null || head.next == null)return head;
         
          ListNode temp = head.next;//保存下一个节点
          ListNode newHead = reverse(head.next);//整体
          temp.next = head;//连上头与递归部分
          head.next = null;//调整尾部
          return newHead;//返回反转链表
    }
//非递归
	public ListNode reverseList2(ListNode head) {
		if (head == null || head.next == null) return head;
	
		ListNode newHead = null;
		while (head != null) {
			ListNode tmp = head.next;
			head.next = newHead;
			newHead = head;
			head = tmp;
		}
		
		return newHead;
    }