Leetcode之Remove Nth Node From End of List 問題

問題描述： Given a linked list, remove the nth node from the end of list (倒數第n個結點)and return its head. Note: Given n will always be valid. Try to do this in one pass. 示例： Given linked list: 1->2->3->4->5,

>>阅读原文<<