如何在单向链表中找到倒数第N个元素

pointer1 = pointer2 = list->head;

n = Math.abs(n);

int distance = 0;

while (true){

        if (distance == n)       

        {

            break;

        } 

        pointer2 = pointer2->next;

        if (pointer2 == null) {

            return false;

        }

        distance++;   

}

while(pointer2->next != null) {

       pointer1 = pointer1->next;

       pointer2 = pointer2->next;

}

return *pointer1;