首页 > 代码库 > ［LeetCode］206. Reverse Linked List 解题小结
［LeetCode］206. Reverse Linked List 解题小结
题目：
Reverse a singly linked list.
click to show more hints.
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) {} * }; */ /** * Reverse Iteratively */class Solution {public: ListNode* reverseList(ListNode* head) { ListNode* revHead = NULL; ListNode* rev = head; while(rev){ head = rev; rev = rev->next; head->next = revHead; revHead = head; } return revHead; }};
用递归来做：
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ /** * Reverse Iteratively */class Solution {public: ListNode* reverseList(ListNode* head) { if(!head || (!head->next))return head; ListNode* node = reverseList(head->next); head->next->next = head; head->next = NULL; return node; }};
［LeetCode］206. Reverse Linked List 解题小结
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。