Reverse Linked List以及一道有关倒序的题目

一.Reverse a singly linked list.

Hint:

A linked list can be reversed either iteratively or recursively. Could you implement both?

递归法：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
      if(head&&head->next){
      ListNode*p=head->next;
      head->next=nullptr;
      ListNode*newhead=reverseList(p);
      p->next=head;
      return newhead;
      }
      return head;
        
    }
};

每次把第一个节点扔到最后，循环到最终状态

迭代法：

(1) Create a Node named prehead before  head and  locate the immediate node before them-th (no