[C语言][LeetCode][19]Remove Nth Node From End of List

题目

Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.

For example,

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Try to do this in one pass.

标签

Linked List、Two Pointers

难度

简单

分析

题目意思是给定一个单链表，删除从表尾开始数的第n个数字，并返回删除后的链表。我这里的做法比较简单，先遍历一遍链表，得到总长len，然后再计算得到顺序删除的值len-n，最后在遍历一次删除。

C代码实现

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
    int listLen = 0;
    int count = 0;
    int i = 0;
    struct ListNode* p = head;
    struct ListNode* q = head;

    if(!head)
        return head;

    while(p)
    {
        listLen++;
        p = p->next;
    }

    count = listLen - n;

    while(q && i<count-1)
    {
        q = q->next;
        i++;
    }

    if(count == 0)
    {
        head = head->next;
    }
    else
    {
        q->next = q->next->next;
    }

    return head;
}