LeetCode第92题:反转链表 II

凡尘若诗

于 2024-10-07 10:39:41 发布

阅读量22

点赞数 1

文章标签： leetcode 链表算法

本文链接：https://blog.csdn.net/2301_80423531/article/details/142735994

版权

题目

在这里插入图片描述

解法

1.连接法

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 * /
 struct ListNode* reverseBetween(struct ListNode* head, int left, int right){
    struct ListNode *dummy = (struct ListNode*)malloc(sizeof(struct ListNode));
    dummy->next = head;
    struct ListNode *p = dummy;
    for(int i = 0; i < left-1; i++)
    	p = p->next;
    struct ListNode *pre = NULL, *cur = p->next;
    while(1 + (right--) -left)
    {
    	struct ListNode *next = cur->next;
    	cur->next = pre;
    	pre = cur;
    	cur = next;
    }
    p->next->next = cur;
    p->next = pre;
    return dummy->next;
}

2.一次遍历

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* reverseBetween(struct ListNode* head, int left, int right){
	if(left == right)
		return head;
	struct ListNode *pre = NULL, *next = NULL, *p=head;
	struct ListNode *l = NULL, *r = NULL;
	int i = 1;
	while(p != NULL && i <= right)
	{
		next = p->next;
		if(i == left)
		{
			l = pre;//记录反转链表的前一个结点
			r = p;  //记录反转链表要指向的结点
		}
		if(i >= left)
			p->next = pre;
		if(i == right)
		{
			if(l != NULL)
				l->next = p;
			r->next = next;
			if(left == 1)
				head = p;
		}
		pre = p;
		p = next;
		i++;
	}	
	return head;
}