难度简单1836收藏分享切换为英文接收动态反馈
给你单链表的头节点 head
,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5] 输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2] 输出:[2,1]
示例 3:
输入:head = [] 输出:[]
提示:
- 链表中节点的数目范围是
[0, 5000]
-5000 <= Node.val <= 5000
进阶:链表可以选用迭代或递归方式完成反转。你能否用两种方法解决这道题?
--------------------------------分割线----------------------------------
思路:新建链表,节点的值和next指针细心一点赋好值就行了
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head){
struct ListNode* tmp1;
struct ListNode* tmp2;
struct ListNode* new;
tmp1 = head;
if(tmp1==NULL)
return NULL;
tmp2=(struct ListNode*)malloc(sizeof(struct ListNode));
tmp2->val = tmp1->val;
tmp2->next = NULL;
while(tmp1->next!=NULL){
tmp1=tmp1->next;
new=(struct ListNode*)malloc(sizeof(struct ListNode));
new->val = tmp1->val;
new->next = tmp2;
tmp2=new;
}
return tmp2;
}