19. 删除链表的倒数第N个节点--LeetCode

题目描述

示例：

给定一个链表: 1->2->3->4->5, 和 n = 2.

当删除了倒数第二个节点后，链表变为 1->2->3->5.

说明：

给定的 n 保证是有效的。

进阶：

你能尝试使用一趟扫描实现吗？

直接上进阶版代码和测试代码---在LeetCode上已测试并提交

#define _CRT_SECURE_NO_DEPRECATE 1

#include "stdio.h"
#include "stdlib.h"
struct ListNode {
	int val;
    struct ListNode *next;
};

struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
	if (!head->next)return NULL;
	struct ListNode* back = head;   //走在后面
	struct ListNode* mid = head;   //走在中间
	struct ListNode* front = head;//遍历时走在最前面的

	while (--n){
		front = front->next;
	}
	while (front->next != NULL){
		back = mid;
		mid = mid->next;
		front = front->next;
	}
	if (mid == back){
		head = mid->next;
	}
	else{
		back->next = mid->next;
	}
	free(mid);
	return head;
}


int main()
{
	int n = 3;
	struct ListNode* n1 = (struct ListNode*)malloc(sizeof(struct ListNode));
	struct ListNode* n2 = (struct ListNode*)malloc(sizeof(struct ListNode));
	struct ListNode* n3 = (struct ListNode*)malloc(sizeof(struct ListNode));
	struct ListNode* n4 = (struct ListNode*)malloc(sizeof(struct ListNode));

	n1->next = n2; n2->next = n3; n3->next = n4; n4->next = NULL;
	n1->val = 1; n2->val = 2; n3->val = 3; n4->val = 4;

	removeNthFromEnd(n1, n);

	return 0;
}